/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:48:48,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:48:48,111 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:48:48,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:48:48,123 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:48:48,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:48:48,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:48:48,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:48:48,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:48:48,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:48:48,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:48:48,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:48:48,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:48:48,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:48:48,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:48:48,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:48:48,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:48:48,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:48:48,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:48:48,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:48:48,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:48:48,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:48:48,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:48:48,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:48:48,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:48:48,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:48:48,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:48:48,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:48:48,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:48:48,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:48:48,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:48:48,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:48:48,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:48:48,161 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:48:48,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:48:48,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:48:48,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:48:48,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:48:48,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:48:48,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:48:48,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:48:48,166 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:48:48,179 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:48:48,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:48:48,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:48:48,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:48:48,181 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:48:48,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:48:48,182 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:48:48,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:48:48,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:48:48,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:48:48,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:48:48,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:48:48,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:48:48,183 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:48:48,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:48:48,183 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:48:48,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:48:48,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:48:48,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:48:48,184 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:48:48,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:48:48,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:48:48,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:48:48,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:48:48,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:48:48,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:48:48,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:48:48,186 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:48:48,186 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:48:48,186 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:48:48,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:48:48,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:48:48,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:48:48,454 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:48:48,455 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:48:48,456 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc.i [2019-12-18 12:48:48,531 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957250501/96e68648b40748a18b4c6d05ef226fd0/FLAGa28cdb551 [2019-12-18 12:48:49,091 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:48:49,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc.i [2019-12-18 12:48:49,120 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957250501/96e68648b40748a18b4c6d05ef226fd0/FLAGa28cdb551 [2019-12-18 12:48:49,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957250501/96e68648b40748a18b4c6d05ef226fd0 [2019-12-18 12:48:49,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:48:49,389 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:48:49,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:48:49,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:48:49,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:48:49,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:48:49" (1/1) ... [2019-12-18 12:48:49,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a01646e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:48:49, skipping insertion in model container [2019-12-18 12:48:49,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:48:49" (1/1) ... [2019-12-18 12:48:49,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:48:49,449 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:48:49,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:48:50,009 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:48:50,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:48:50,172 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:48:50,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:48:50 WrapperNode [2019-12-18 12:48:50,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:48:50,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:48:50,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:48:50,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:48:50,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:48:50" (1/1) ... [2019-12-18 12:48:50,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:48:50" (1/1) ... [2019-12-18 12:48:50,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:48:50,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:48:50,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:48:50,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:48:50,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:48:50" (1/1) ... [2019-12-18 12:48:50,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:48:50" (1/1) ... [2019-12-18 12:48:50,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:48:50" (1/1) ... [2019-12-18 12:48:50,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:48:50" (1/1) ... [2019-12-18 12:48:50,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:48:50" (1/1) ... [2019-12-18 12:48:50,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:48:50" (1/1) ... [2019-12-18 12:48:50,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:48:50" (1/1) ... [2019-12-18 12:48:50,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:48:50,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:48:50,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:48:50,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:48:50,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:48:50" (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 12:48:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:48:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:48:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:48:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:48:50,339 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:48:50,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:48:50,339 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:48:50,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:48:50,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:48:50,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:48:50,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:48:50,344 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 12:48:51,039 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:48:51,039 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:48:51,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:48:51 BoogieIcfgContainer [2019-12-18 12:48:51,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:48:51,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:48:51,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:48:51,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:48:51,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:48:49" (1/3) ... [2019-12-18 12:48:51,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7300e739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:48:51, skipping insertion in model container [2019-12-18 12:48:51,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:48:50" (2/3) ... [2019-12-18 12:48:51,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7300e739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:48:51, skipping insertion in model container [2019-12-18 12:48:51,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:48:51" (3/3) ... [2019-12-18 12:48:51,052 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc.i [2019-12-18 12:48:51,063 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:48:51,063 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:48:51,071 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:48:51,072 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:48:51,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,112 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,113 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,113 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,114 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,114 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,124 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,124 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,157 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,158 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,158 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,179 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,182 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:48:51,198 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 12:48:51,219 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:48:51,220 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:48:51,220 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:48:51,220 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:48:51,220 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:48:51,220 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:48:51,221 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:48:51,221 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:48:51,242 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 12:48:51,244 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 12:48:51,351 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 12:48:51,352 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:48:51,367 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 12:48:51,387 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 12:48:51,426 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 12:48:51,426 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:48:51,433 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 12:48:51,448 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 12:48:51,449 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:48:55,314 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 19 [2019-12-18 12:48:56,561 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 12:48:56,719 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-18 12:48:56,719 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 12:48:56,723 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-18 12:48:57,165 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-18 12:48:57,167 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-18 12:48:57,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:48:57,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:48:57,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:48:57,175 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:48:57,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:48:57,181 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-18 12:48:57,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:48:57,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674895357] [2019-12-18 12:48:57,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:48:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:48:57,409 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 12:48:57,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674895357] [2019-12-18 12:48:57,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:48:57,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:48:57,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142390283] [2019-12-18 12:48:57,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:48:57,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:48:57,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:48:57,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:48:57,435 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-18 12:48:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:48:57,680 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-18 12:48:57,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:48:57,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:48:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:48:57,770 INFO L225 Difference]: With dead ends: 8468 [2019-12-18 12:48:57,771 INFO L226 Difference]: Without dead ends: 7976 [2019-12-18 12:48:57,772 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 12:48:57,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-18 12:48:58,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-18 12:48:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-18 12:48:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-18 12:48:58,265 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-18 12:48:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:48:58,266 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-18 12:48:58,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:48:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-18 12:48:58,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:48:58,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:48:58,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:48:58,270 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:48:58,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:48:58,270 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-18 12:48:58,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:48:58,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159187259] [2019-12-18 12:48:58,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:48:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:48:58,405 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 12:48:58,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159187259] [2019-12-18 12:48:58,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:48:58,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:48:58,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278724251] [2019-12-18 12:48:58,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:48:58,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:48:58,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:48:58,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:48:58,410 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-18 12:48:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:48:58,814 INFO L93 Difference]: Finished difference Result 12178 states and 37599 transitions. [2019-12-18 12:48:58,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:48:58,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:48:58,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:48:58,883 INFO L225 Difference]: With dead ends: 12178 [2019-12-18 12:48:58,883 INFO L226 Difference]: Without dead ends: 12171 [2019-12-18 12:48:58,884 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 12:48:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-18 12:48:59,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 10893. [2019-12-18 12:48:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10893 states. [2019-12-18 12:48:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10893 states to 10893 states and 34228 transitions. [2019-12-18 12:48:59,834 INFO L78 Accepts]: Start accepts. Automaton has 10893 states and 34228 transitions. Word has length 11 [2019-12-18 12:48:59,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:48:59,835 INFO L462 AbstractCegarLoop]: Abstraction has 10893 states and 34228 transitions. [2019-12-18 12:48:59,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:48:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 10893 states and 34228 transitions. [2019-12-18 12:48:59,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 12:48:59,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:48:59,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:48:59,841 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:48:59,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:48:59,841 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-18 12:48:59,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:48:59,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730432411] [2019-12-18 12:48:59,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:48:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:48:59,954 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 12:48:59,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730432411] [2019-12-18 12:48:59,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:48:59,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:48:59,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81302889] [2019-12-18 12:48:59,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:48:59,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:48:59,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:48:59,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:48:59,957 INFO L87 Difference]: Start difference. First operand 10893 states and 34228 transitions. Second operand 4 states. [2019-12-18 12:49:00,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:00,209 INFO L93 Difference]: Finished difference Result 13366 states and 41774 transitions. [2019-12-18 12:49:00,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:49:00,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 12:49:00,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:00,256 INFO L225 Difference]: With dead ends: 13366 [2019-12-18 12:49:00,256 INFO L226 Difference]: Without dead ends: 13366 [2019-12-18 12:49:00,257 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 12:49:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-18 12:49:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 11878. [2019-12-18 12:49:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11878 states. [2019-12-18 12:49:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11878 states to 11878 states and 37348 transitions. [2019-12-18 12:49:00,796 INFO L78 Accepts]: Start accepts. Automaton has 11878 states and 37348 transitions. Word has length 14 [2019-12-18 12:49:00,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:00,797 INFO L462 AbstractCegarLoop]: Abstraction has 11878 states and 37348 transitions. [2019-12-18 12:49:00,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:49:00,798 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states and 37348 transitions. [2019-12-18 12:49:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:49:00,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:00,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:00,801 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:00,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:00,802 INFO L82 PathProgramCache]: Analyzing trace with hash 525416671, now seen corresponding path program 1 times [2019-12-18 12:49:00,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:00,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816709555] [2019-12-18 12:49:00,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:00,863 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 12:49:00,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816709555] [2019-12-18 12:49:00,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:00,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:49:00,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204872527] [2019-12-18 12:49:00,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:49:00,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:00,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:49:00,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:49:00,868 INFO L87 Difference]: Start difference. First operand 11878 states and 37348 transitions. Second operand 3 states. [2019-12-18 12:49:00,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:00,912 INFO L93 Difference]: Finished difference Result 11853 states and 37274 transitions. [2019-12-18 12:49:00,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:49:00,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 12:49:00,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:00,945 INFO L225 Difference]: With dead ends: 11853 [2019-12-18 12:49:00,945 INFO L226 Difference]: Without dead ends: 11853 [2019-12-18 12:49:00,946 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 12:49:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2019-12-18 12:49:01,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 11853. [2019-12-18 12:49:01,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11853 states. [2019-12-18 12:49:01,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11853 states to 11853 states and 37274 transitions. [2019-12-18 12:49:01,279 INFO L78 Accepts]: Start accepts. Automaton has 11853 states and 37274 transitions. Word has length 16 [2019-12-18 12:49:01,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:01,280 INFO L462 AbstractCegarLoop]: Abstraction has 11853 states and 37274 transitions. [2019-12-18 12:49:01,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:49:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 11853 states and 37274 transitions. [2019-12-18 12:49:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 12:49:01,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:01,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:01,287 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:01,288 INFO L82 PathProgramCache]: Analyzing trace with hash -886588009, now seen corresponding path program 1 times [2019-12-18 12:49:01,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:01,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987981810] [2019-12-18 12:49:01,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:01,373 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 12:49:01,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987981810] [2019-12-18 12:49:01,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:01,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:49:01,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291585599] [2019-12-18 12:49:01,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:49:01,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:01,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:49:01,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:49:01,376 INFO L87 Difference]: Start difference. First operand 11853 states and 37274 transitions. Second operand 3 states. [2019-12-18 12:49:01,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:01,428 INFO L93 Difference]: Finished difference Result 11207 states and 34674 transitions. [2019-12-18 12:49:01,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:49:01,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 12:49:01,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:01,448 INFO L225 Difference]: With dead ends: 11207 [2019-12-18 12:49:01,449 INFO L226 Difference]: Without dead ends: 11207 [2019-12-18 12:49:01,449 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 12:49:01,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11207 states. [2019-12-18 12:49:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11207 to 11127. [2019-12-18 12:49:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11127 states. [2019-12-18 12:49:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11127 states to 11127 states and 34442 transitions. [2019-12-18 12:49:01,909 INFO L78 Accepts]: Start accepts. Automaton has 11127 states and 34442 transitions. Word has length 17 [2019-12-18 12:49:01,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:01,909 INFO L462 AbstractCegarLoop]: Abstraction has 11127 states and 34442 transitions. [2019-12-18 12:49:01,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:49:01,909 INFO L276 IsEmpty]: Start isEmpty. Operand 11127 states and 34442 transitions. [2019-12-18 12:49:01,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 12:49:01,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:01,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:01,914 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:01,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:01,914 INFO L82 PathProgramCache]: Analyzing trace with hash -851147492, now seen corresponding path program 1 times [2019-12-18 12:49:01,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:01,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692723247] [2019-12-18 12:49:01,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:02,031 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 12:49:02,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692723247] [2019-12-18 12:49:02,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:02,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:49:02,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676060124] [2019-12-18 12:49:02,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:49:02,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:02,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:49:02,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:49:02,033 INFO L87 Difference]: Start difference. First operand 11127 states and 34442 transitions. Second operand 4 states. [2019-12-18 12:49:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:02,066 INFO L93 Difference]: Finished difference Result 2147 states and 5357 transitions. [2019-12-18 12:49:02,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:49:02,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 12:49:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:02,070 INFO L225 Difference]: With dead ends: 2147 [2019-12-18 12:49:02,070 INFO L226 Difference]: Without dead ends: 1515 [2019-12-18 12:49:02,070 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 12:49:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2019-12-18 12:49:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1515. [2019-12-18 12:49:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2019-12-18 12:49:02,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 3348 transitions. [2019-12-18 12:49:02,096 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 3348 transitions. Word has length 17 [2019-12-18 12:49:02,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:02,096 INFO L462 AbstractCegarLoop]: Abstraction has 1515 states and 3348 transitions. [2019-12-18 12:49:02,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:49:02,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 3348 transitions. [2019-12-18 12:49:02,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:49:02,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:02,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:02,099 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:02,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:02,100 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-18 12:49:02,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:02,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574798035] [2019-12-18 12:49:02,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:02,233 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 12:49:02,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574798035] [2019-12-18 12:49:02,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:02,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:49:02,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260328168] [2019-12-18 12:49:02,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:49:02,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:02,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:49:02,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:49:02,235 INFO L87 Difference]: Start difference. First operand 1515 states and 3348 transitions. Second operand 6 states. [2019-12-18 12:49:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:02,817 INFO L93 Difference]: Finished difference Result 4210 states and 9198 transitions. [2019-12-18 12:49:02,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:49:02,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 12:49:02,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:02,824 INFO L225 Difference]: With dead ends: 4210 [2019-12-18 12:49:02,824 INFO L226 Difference]: Without dead ends: 4175 [2019-12-18 12:49:02,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:49:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4175 states. [2019-12-18 12:49:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4175 to 1849. [2019-12-18 12:49:02,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2019-12-18 12:49:02,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 4161 transitions. [2019-12-18 12:49:02,874 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 4161 transitions. Word has length 25 [2019-12-18 12:49:02,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:02,874 INFO L462 AbstractCegarLoop]: Abstraction has 1849 states and 4161 transitions. [2019-12-18 12:49:02,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:49:02,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 4161 transitions. [2019-12-18 12:49:02,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 12:49:02,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:02,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:02,878 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:02,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:02,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-18 12:49:02,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:02,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585523333] [2019-12-18 12:49:02,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:02,966 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 12:49:02,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585523333] [2019-12-18 12:49:02,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:02,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:49:02,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034311245] [2019-12-18 12:49:02,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:49:02,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:02,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:49:02,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:49:02,969 INFO L87 Difference]: Start difference. First operand 1849 states and 4161 transitions. Second operand 6 states. [2019-12-18 12:49:03,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:03,849 INFO L93 Difference]: Finished difference Result 3919 states and 8500 transitions. [2019-12-18 12:49:03,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:49:03,849 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-18 12:49:03,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:03,855 INFO L225 Difference]: With dead ends: 3919 [2019-12-18 12:49:03,855 INFO L226 Difference]: Without dead ends: 3890 [2019-12-18 12:49:03,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:49:03,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2019-12-18 12:49:03,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 1828. [2019-12-18 12:49:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1828 states. [2019-12-18 12:49:03,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 4133 transitions. [2019-12-18 12:49:03,895 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 4133 transitions. Word has length 26 [2019-12-18 12:49:03,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:03,896 INFO L462 AbstractCegarLoop]: Abstraction has 1828 states and 4133 transitions. [2019-12-18 12:49:03,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:49:03,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 4133 transitions. [2019-12-18 12:49:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:49:03,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:03,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:03,899 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:03,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:03,900 INFO L82 PathProgramCache]: Analyzing trace with hash 382543579, now seen corresponding path program 1 times [2019-12-18 12:49:03,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:03,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910850267] [2019-12-18 12:49:03,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:03,941 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 12:49:03,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910850267] [2019-12-18 12:49:03,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:03,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:49:03,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340402173] [2019-12-18 12:49:03,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:49:03,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:03,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:49:03,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:49:03,944 INFO L87 Difference]: Start difference. First operand 1828 states and 4133 transitions. Second operand 3 states. [2019-12-18 12:49:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:03,969 INFO L93 Difference]: Finished difference Result 3313 states and 7495 transitions. [2019-12-18 12:49:03,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:49:03,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-18 12:49:03,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:03,973 INFO L225 Difference]: With dead ends: 3313 [2019-12-18 12:49:03,973 INFO L226 Difference]: Without dead ends: 1754 [2019-12-18 12:49:03,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:49:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2019-12-18 12:49:04,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1726. [2019-12-18 12:49:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-12-18 12:49:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3821 transitions. [2019-12-18 12:49:04,012 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3821 transitions. Word has length 28 [2019-12-18 12:49:04,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:04,013 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 3821 transitions. [2019-12-18 12:49:04,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:49:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3821 transitions. [2019-12-18 12:49:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:49:04,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:04,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:04,017 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:04,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:04,017 INFO L82 PathProgramCache]: Analyzing trace with hash -5510903, now seen corresponding path program 2 times [2019-12-18 12:49:04,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:04,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955743389] [2019-12-18 12:49:04,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:04,102 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 12:49:04,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955743389] [2019-12-18 12:49:04,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:04,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:49:04,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976785197] [2019-12-18 12:49:04,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:49:04,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:04,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:49:04,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:49:04,105 INFO L87 Difference]: Start difference. First operand 1726 states and 3821 transitions. Second operand 5 states. [2019-12-18 12:49:04,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:04,157 INFO L93 Difference]: Finished difference Result 890 states and 1927 transitions. [2019-12-18 12:49:04,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:49:04,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:49:04,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:04,160 INFO L225 Difference]: With dead ends: 890 [2019-12-18 12:49:04,160 INFO L226 Difference]: Without dead ends: 722 [2019-12-18 12:49:04,161 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 12:49:04,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-12-18 12:49:04,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2019-12-18 12:49:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-12-18 12:49:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1611 transitions. [2019-12-18 12:49:04,176 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1611 transitions. Word has length 28 [2019-12-18 12:49:04,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:04,177 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1611 transitions. [2019-12-18 12:49:04,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:49:04,177 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1611 transitions. [2019-12-18 12:49:04,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 12:49:04,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:04,179 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] [2019-12-18 12:49:04,180 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:04,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:04,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1412598433, now seen corresponding path program 1 times [2019-12-18 12:49:04,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:04,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124779130] [2019-12-18 12:49:04,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:04,298 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 12:49:04,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124779130] [2019-12-18 12:49:04,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:04,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:49:04,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930447406] [2019-12-18 12:49:04,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:49:04,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:04,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:49:04,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:49:04,302 INFO L87 Difference]: Start difference. First operand 722 states and 1611 transitions. Second operand 7 states. [2019-12-18 12:49:04,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:04,499 INFO L93 Difference]: Finished difference Result 1443 states and 3133 transitions. [2019-12-18 12:49:04,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:49:04,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 12:49:04,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:04,501 INFO L225 Difference]: With dead ends: 1443 [2019-12-18 12:49:04,501 INFO L226 Difference]: Without dead ends: 966 [2019-12-18 12:49:04,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:49:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-12-18 12:49:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 795. [2019-12-18 12:49:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-12-18 12:49:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1734 transitions. [2019-12-18 12:49:04,515 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1734 transitions. Word has length 52 [2019-12-18 12:49:04,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:04,515 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1734 transitions. [2019-12-18 12:49:04,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:49:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1734 transitions. [2019-12-18 12:49:04,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 12:49:04,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:04,518 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] [2019-12-18 12:49:04,518 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:04,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:04,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1409603297, now seen corresponding path program 2 times [2019-12-18 12:49:04,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:04,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159130597] [2019-12-18 12:49:04,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:04,610 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 12:49:04,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159130597] [2019-12-18 12:49:04,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:04,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:49:04,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209545152] [2019-12-18 12:49:04,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:49:04,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:04,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:49:04,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:49:04,612 INFO L87 Difference]: Start difference. First operand 795 states and 1734 transitions. Second operand 3 states. [2019-12-18 12:49:04,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:04,663 INFO L93 Difference]: Finished difference Result 1005 states and 2172 transitions. [2019-12-18 12:49:04,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:49:04,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 12:49:04,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:04,665 INFO L225 Difference]: With dead ends: 1005 [2019-12-18 12:49:04,665 INFO L226 Difference]: Without dead ends: 1005 [2019-12-18 12:49:04,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 12:49:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-12-18 12:49:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 703. [2019-12-18 12:49:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-12-18 12:49:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1519 transitions. [2019-12-18 12:49:04,677 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1519 transitions. Word has length 52 [2019-12-18 12:49:04,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:04,678 INFO L462 AbstractCegarLoop]: Abstraction has 703 states and 1519 transitions. [2019-12-18 12:49:04,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:49:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1519 transitions. [2019-12-18 12:49:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:49:04,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:04,680 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] [2019-12-18 12:49:04,680 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:04,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:04,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 1 times [2019-12-18 12:49:04,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:04,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123141697] [2019-12-18 12:49:04,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:49:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:49:04,801 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:49:04,802 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:49:04,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t585~0.base_29| 1)) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t585~0.base_29| 4)) (= 0 v_~__unbuffered_cnt~0_62) (= |v_ULTIMATE.start_main_~#t585~0.offset_20| 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t585~0.base_29|) 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t585~0.base_29|) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t585~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t585~0.base_29|) |v_ULTIMATE.start_main_~#t585~0.offset_20| 0)) |v_#memory_int_15|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ULTIMATE.start_main_~#t585~0.base=|v_ULTIMATE.start_main_~#t585~0.base_29|, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_17|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, ULTIMATE.start_main_~#t585~0.offset=|v_ULTIMATE.start_main_~#t585~0.offset_20|, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t585~0.base, #length, ~y~0, ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t585~0.offset, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 12:49:04,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t586~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t586~0.base_12| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t586~0.base_12|) (= |v_ULTIMATE.start_main_~#t586~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12|) |v_ULTIMATE.start_main_~#t586~0.offset_10| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_12|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 12:49:04,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66 0)) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 12:49:04,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-973331773 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-973331773 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-973331773| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-973331773| ~y$w_buff0_used~0_In-973331773) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-973331773, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-973331773} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-973331773|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-973331773, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-973331773} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 12:49:04,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1959203213 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In-1959203213| |P1Thread1of1ForFork1_#t~ite14_Out-1959203213|) (= ~y$w_buff0~0_In-1959203213 |P1Thread1of1ForFork1_#t~ite15_Out-1959203213|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1959203213 256)))) (or (= (mod ~y$w_buff0_used~0_In-1959203213 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1959203213 256)) .cse1) (and (= (mod ~y$w_buff1_used~0_In-1959203213 256) 0) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out-1959203213| |P1Thread1of1ForFork1_#t~ite14_Out-1959203213|) (= ~y$w_buff0~0_In-1959203213 |P1Thread1of1ForFork1_#t~ite14_Out-1959203213|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1959203213, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1959203213, ~y$w_buff0~0=~y$w_buff0~0_In-1959203213, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1959203213, ~weak$$choice2~0=~weak$$choice2~0_In-1959203213, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1959203213|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1959203213} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1959203213, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1959203213, ~y$w_buff0~0=~y$w_buff0~0_In-1959203213, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1959203213, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1959203213|, ~weak$$choice2~0=~weak$$choice2~0_In-1959203213, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1959203213|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1959203213} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 12:49:04,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1071201902 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out-1071201902| ~y$w_buff1~0_In-1071201902) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In-1071201902| |P1Thread1of1ForFork1_#t~ite17_Out-1071201902|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1071201902 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1071201902 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1071201902 256))) (and (= 0 (mod ~y$w_buff1_used~0_In-1071201902 256)) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite17_Out-1071201902| ~y$w_buff1~0_In-1071201902) (= |P1Thread1of1ForFork1_#t~ite18_Out-1071201902| |P1Thread1of1ForFork1_#t~ite17_Out-1071201902|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1071201902, ~y$w_buff1~0=~y$w_buff1~0_In-1071201902, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1071201902, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1071201902, ~weak$$choice2~0=~weak$$choice2~0_In-1071201902, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1071201902|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1071201902} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1071201902, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1071201902|, ~y$w_buff1~0=~y$w_buff1~0_In-1071201902, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1071201902, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1071201902, ~weak$$choice2~0=~weak$$choice2~0_In-1071201902, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1071201902|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1071201902} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 12:49:04,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd1~0_In1853110299 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1853110299 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1853110299 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1853110299 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1853110299| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1853110299| ~y$w_buff1_used~0_In1853110299) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1853110299, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1853110299, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1853110299, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1853110299} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1853110299|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1853110299, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1853110299, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1853110299, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1853110299} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 12:49:04,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-310136697 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-310136697 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out-310136697 0)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_Out-310136697 ~y$r_buff0_thd1~0_In-310136697)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-310136697, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-310136697} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-310136697, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-310136697|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-310136697} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:49:04,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In894814235 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In894814235 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In894814235 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In894814235 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out894814235|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In894814235 |P0Thread1of1ForFork0_#t~ite8_Out894814235|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In894814235, ~y$w_buff0_used~0=~y$w_buff0_used~0_In894814235, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In894814235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In894814235} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In894814235, ~y$w_buff0_used~0=~y$w_buff0_used~0_In894814235, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out894814235|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In894814235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In894814235} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 12:49:04,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In627842552 256)))) (or (and (= ~y$w_buff0_used~0_In627842552 |P1Thread1of1ForFork1_#t~ite21_Out627842552|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In627842552| |P1Thread1of1ForFork1_#t~ite20_Out627842552|)) (and (= ~y$w_buff0_used~0_In627842552 |P1Thread1of1ForFork1_#t~ite20_Out627842552|) (= |P1Thread1of1ForFork1_#t~ite21_Out627842552| |P1Thread1of1ForFork1_#t~ite20_Out627842552|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In627842552 256)))) (or (and (= (mod ~y$w_buff1_used~0_In627842552 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In627842552 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In627842552 256)) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In627842552, ~y$w_buff0_used~0=~y$w_buff0_used~0_In627842552, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In627842552|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In627842552, ~weak$$choice2~0=~weak$$choice2~0_In627842552, ~y$w_buff1_used~0=~y$w_buff1_used~0_In627842552} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In627842552, ~y$w_buff0_used~0=~y$w_buff0_used~0_In627842552, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out627842552|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In627842552, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out627842552|, ~weak$$choice2~0=~weak$$choice2~0_In627842552, ~y$w_buff1_used~0=~y$w_buff1_used~0_In627842552} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 12:49:04,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 12:49:04,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2037347397 256) 0))) (or (and (not .cse0) (= ~y$r_buff1_thd2~0_In-2037347397 |P1Thread1of1ForFork1_#t~ite30_Out-2037347397|) (= |P1Thread1of1ForFork1_#t~ite29_In-2037347397| |P1Thread1of1ForFork1_#t~ite29_Out-2037347397|)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out-2037347397| |P1Thread1of1ForFork1_#t~ite29_Out-2037347397|) (= ~y$r_buff1_thd2~0_In-2037347397 |P1Thread1of1ForFork1_#t~ite29_Out-2037347397|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2037347397 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2037347397 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In-2037347397 256) 0)) (= (mod ~y$w_buff0_used~0_In-2037347397 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2037347397, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2037347397|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2037347397, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2037347397, ~weak$$choice2~0=~weak$$choice2~0_In-2037347397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2037347397} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2037347397, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2037347397|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2037347397|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2037347397, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2037347397, ~weak$$choice2~0=~weak$$choice2~0_In-2037347397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2037347397} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 12:49:04,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:49:04,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 12:49:04,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In365020687 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In365020687 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out365020687| ~y~0_In365020687) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff1~0_In365020687 |P1Thread1of1ForFork1_#t~ite32_Out365020687|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In365020687, ~y$w_buff1~0=~y$w_buff1~0_In365020687, ~y~0=~y~0_In365020687, ~y$w_buff1_used~0=~y$w_buff1_used~0_In365020687} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In365020687, ~y$w_buff1~0=~y$w_buff1~0_In365020687, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out365020687|, ~y~0=~y~0_In365020687, ~y$w_buff1_used~0=~y$w_buff1_used~0_In365020687} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 12:49:04,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 12:49:04,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-750639917 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-750639917 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-750639917| ~y$w_buff0_used~0_In-750639917)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-750639917|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-750639917, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-750639917} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-750639917, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-750639917, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-750639917|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 12:49:04,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In1606574551 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1606574551 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1606574551 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1606574551 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1606574551|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1606574551 |P1Thread1of1ForFork1_#t~ite35_Out1606574551|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1606574551, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1606574551, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1606574551, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1606574551} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1606574551, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1606574551, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1606574551, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1606574551|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1606574551} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 12:49:04,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-597818789 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-597818789 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-597818789 |P1Thread1of1ForFork1_#t~ite36_Out-597818789|)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-597818789| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-597818789, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-597818789} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-597818789, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-597818789, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-597818789|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 12:49:04,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1302975709 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1302975709 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1302975709 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1302975709 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In1302975709 |P1Thread1of1ForFork1_#t~ite37_Out1302975709|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1302975709|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1302975709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1302975709, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1302975709, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1302975709} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1302975709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1302975709, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1302975709, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1302975709|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1302975709} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 12:49:04,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 12:49:04,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 12:49:04,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In634116054 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In634116054 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out634116054| ~y$w_buff1~0_In634116054) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out634116054| ~y~0_In634116054) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In634116054, ~y~0=~y~0_In634116054, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In634116054, ~y$w_buff1_used~0=~y$w_buff1_used~0_In634116054} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out634116054|, ~y$w_buff1~0=~y$w_buff1~0_In634116054, ~y~0=~y~0_In634116054, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In634116054, ~y$w_buff1_used~0=~y$w_buff1_used~0_In634116054} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 12:49:04,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 12:49:04,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-946983066 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-946983066 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-946983066| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-946983066| ~y$w_buff0_used~0_In-946983066)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-946983066, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-946983066} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-946983066, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-946983066, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-946983066|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 12:49:04,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-489948088 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-489948088 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-489948088 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-489948088 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-489948088|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-489948088 |ULTIMATE.start_main_#t~ite43_Out-489948088|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-489948088, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-489948088, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-489948088, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-489948088} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-489948088, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-489948088, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-489948088|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-489948088, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-489948088} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 12:49:04,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In536516469 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In536516469 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In536516469 |ULTIMATE.start_main_#t~ite44_Out536516469|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out536516469|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In536516469, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In536516469} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In536516469, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In536516469, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out536516469|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 12:49:04,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In664942470 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In664942470 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In664942470 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In664942470 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out664942470|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In664942470 |ULTIMATE.start_main_#t~ite45_Out664942470|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In664942470, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In664942470, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In664942470, ~y$w_buff1_used~0=~y$w_buff1_used~0_In664942470} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In664942470, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In664942470, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In664942470, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out664942470|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In664942470} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 12:49:04,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p1_EBX~0_24 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:49:04,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:49:04 BasicIcfg [2019-12-18 12:49:04,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:49:04,919 INFO L168 Benchmark]: Toolchain (without parser) took 15530.50 ms. Allocated memory was 137.4 MB in the beginning and 593.5 MB in the end (delta: 456.1 MB). Free memory was 100.6 MB in the beginning and 338.4 MB in the end (delta: -237.8 MB). Peak memory consumption was 218.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:04,920 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 137.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 12:49:04,921 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.58 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 155.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:04,921 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.25 ms. Allocated memory is still 201.3 MB. Free memory was 155.2 MB in the beginning and 153.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:04,922 INFO L168 Benchmark]: Boogie Preprocessor took 38.01 ms. Allocated memory is still 201.3 MB. Free memory was 153.1 MB in the beginning and 150.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:04,923 INFO L168 Benchmark]: RCFGBuilder took 766.95 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 106.6 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:04,924 INFO L168 Benchmark]: TraceAbstraction took 13875.28 ms. Allocated memory was 201.3 MB in the beginning and 593.5 MB in the end (delta: 392.2 MB). Free memory was 105.6 MB in the beginning and 338.4 MB in the end (delta: -232.8 MB). Peak memory consumption was 159.4 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:04,928 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.50 ms. Allocated memory is still 137.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.58 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 155.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.25 ms. Allocated memory is still 201.3 MB. Free memory was 155.2 MB in the beginning and 153.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.01 ms. Allocated memory is still 201.3 MB. Free memory was 153.1 MB in the beginning and 150.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 766.95 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 106.6 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13875.28 ms. Allocated memory was 201.3 MB in the beginning and 593.5 MB in the end (delta: 392.2 MB). Free memory was 105.6 MB in the beginning and 338.4 MB in the end (delta: -232.8 MB). Peak memory consumption was 159.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 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 [!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)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 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) [L763] 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)) [L764] 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)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 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)) [L766] 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_p1_EAX=2, __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_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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 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)) [L768] 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)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 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=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 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 [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 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, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1402 SDtfs, 1575 SDslu, 2348 SDs, 0 SdLazy, 1217 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11878occurred 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: 2.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 7735 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 342 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 23909 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...