/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/mix048_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:43:28,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:43:28,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:43:28,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:43:28,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:43:28,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:43:28,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:43:28,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:43:28,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:43:28,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:43:28,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:43:28,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:43:28,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:43:28,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:43:28,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:43:28,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:43:28,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:43:28,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:43:28,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:43:28,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:43:28,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:43:28,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:43:28,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:43:28,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:43:28,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:43:28,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:43:28,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:43:28,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:43:28,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:43:28,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:43:28,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:43:28,088 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:43:28,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:43:28,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:43:28,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:43:28,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:43:28,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:43:28,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:43:28,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:43:28,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:43:28,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:43:28,094 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 13:43:28,108 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:43:28,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:43:28,109 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:43:28,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:43:28,110 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:43:28,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:43:28,110 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:43:28,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:43:28,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:43:28,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:43:28,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:43:28,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:43:28,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:43:28,112 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:43:28,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:43:28,112 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:43:28,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:43:28,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:43:28,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:43:28,113 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:43:28,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:43:28,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:43:28,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:43:28,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:43:28,114 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:43:28,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:43:28,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:43:28,115 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:43:28,115 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:43:28,115 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:43:28,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:43:28,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:43:28,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:43:28,418 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:43:28,418 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:43:28,419 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_tso.oepc.i [2019-12-18 13:43:28,492 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d526ac45c/687aa057baf1446588e0839321151767/FLAGb4dc9a48f [2019-12-18 13:43:29,040 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:43:29,041 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_tso.oepc.i [2019-12-18 13:43:29,062 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d526ac45c/687aa057baf1446588e0839321151767/FLAGb4dc9a48f [2019-12-18 13:43:29,372 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d526ac45c/687aa057baf1446588e0839321151767 [2019-12-18 13:43:29,379 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:43:29,383 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:43:29,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:43:29,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:43:29,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:43:29,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:43:29" (1/1) ... [2019-12-18 13:43:29,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c8690e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:29, skipping insertion in model container [2019-12-18 13:43:29,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:43:29" (1/1) ... [2019-12-18 13:43:29,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:43:29,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:43:29,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:43:29,991 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:43:30,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:43:30,144 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:43:30,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:30 WrapperNode [2019-12-18 13:43:30,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:43:30,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:43:30,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:43:30,146 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:43:30,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:30" (1/1) ... [2019-12-18 13:43:30,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:30" (1/1) ... [2019-12-18 13:43:30,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:43:30,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:43:30,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:43:30,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:43:30,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:30" (1/1) ... [2019-12-18 13:43:30,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:30" (1/1) ... [2019-12-18 13:43:30,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:30" (1/1) ... [2019-12-18 13:43:30,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:30" (1/1) ... [2019-12-18 13:43:30,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:30" (1/1) ... [2019-12-18 13:43:30,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:30" (1/1) ... [2019-12-18 13:43:30,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:30" (1/1) ... [2019-12-18 13:43:30,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:43:30,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:43:30,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:43:30,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:43:30,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:30" (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 13:43:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:43:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:43:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:43:30,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:43:30,317 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:43:30,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:43:30,317 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:43:30,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:43:30,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:43:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:43:30,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:43:30,320 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 13:43:31,002 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:43:31,003 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:43:31,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:43:31 BoogieIcfgContainer [2019-12-18 13:43:31,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:43:31,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:43:31,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:43:31,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:43:31,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:43:29" (1/3) ... [2019-12-18 13:43:31,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b0183e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:43:31, skipping insertion in model container [2019-12-18 13:43:31,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:43:30" (2/3) ... [2019-12-18 13:43:31,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b0183e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:43:31, skipping insertion in model container [2019-12-18 13:43:31,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:43:31" (3/3) ... [2019-12-18 13:43:31,013 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_tso.oepc.i [2019-12-18 13:43:31,024 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:43:31,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:43:31,033 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:43:31,034 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:43:31,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,076 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,086 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,087 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,121 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,121 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,121 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,127 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,146 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:43:31,163 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 13:43:31,185 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:43:31,186 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:43:31,186 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:43:31,186 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:43:31,186 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:43:31,186 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:43:31,187 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:43:31,187 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:43:31,203 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 13:43:31,205 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 13:43:31,281 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 13:43:31,281 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:43:31,296 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 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:43:31,318 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 13:43:31,365 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 13:43:31,366 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:43:31,376 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 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:43:31,397 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 13:43:31,398 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:43:36,039 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 13:43:36,152 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 13:43:36,221 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-18 13:43:36,221 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-18 13:43:36,225 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-18 13:43:36,681 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-18 13:43:36,683 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-18 13:43:36,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:43:36,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:36,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:43:36,692 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:36,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:36,699 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-18 13:43:36,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:36,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653663554] [2019-12-18 13:43:36,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:36,935 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 13:43:36,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653663554] [2019-12-18 13:43:36,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:36,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:43:36,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207385985] [2019-12-18 13:43:36,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:43:36,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:36,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:43:36,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:43:36,961 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-18 13:43:37,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:37,196 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-18 13:43:37,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:43:37,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:43:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:37,300 INFO L225 Difference]: With dead ends: 8074 [2019-12-18 13:43:37,300 INFO L226 Difference]: Without dead ends: 7606 [2019-12-18 13:43:37,302 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 13:43:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-18 13:43:37,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-18 13:43:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-18 13:43:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-18 13:43:37,695 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-18 13:43:37,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:37,695 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-18 13:43:37,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:43:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-18 13:43:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:43:37,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:37,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:43:37,700 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:37,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:37,700 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-18 13:43:37,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:37,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172345796] [2019-12-18 13:43:37,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:37,831 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 13:43:37,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172345796] [2019-12-18 13:43:37,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:37,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:43:37,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818126696] [2019-12-18 13:43:37,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:43:37,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:37,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:43:37,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:43:37,835 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-18 13:43:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:38,274 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-18 13:43:38,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:43:38,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:43:38,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:38,342 INFO L225 Difference]: With dead ends: 11630 [2019-12-18 13:43:38,342 INFO L226 Difference]: Without dead ends: 11623 [2019-12-18 13:43:38,343 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 13:43:38,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-18 13:43:38,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-18 13:43:38,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-18 13:43:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-18 13:43:38,727 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-18 13:43:38,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:38,727 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-18 13:43:38,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:43:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-18 13:43:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:43:38,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:38,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:43:38,746 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:38,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:38,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-18 13:43:38,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:38,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548666109] [2019-12-18 13:43:38,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:38,859 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 13:43:38,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548666109] [2019-12-18 13:43:38,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:38,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:43:38,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945503483] [2019-12-18 13:43:38,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:43:38,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:38,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:43:38,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:43:38,863 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-18 13:43:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:39,756 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-18 13:43:39,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:43:39,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 13:43:39,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:39,809 INFO L225 Difference]: With dead ends: 14471 [2019-12-18 13:43:39,809 INFO L226 Difference]: Without dead ends: 14471 [2019-12-18 13:43:39,810 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 13:43:39,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-18 13:43:40,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-18 13:43:40,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-18 13:43:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-18 13:43:40,214 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-18 13:43:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:40,215 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-18 13:43:40,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:43:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-18 13:43:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:43:40,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:40,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:43:40,219 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:40,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:40,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-18 13:43:40,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:40,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613419218] [2019-12-18 13:43:40,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:40,305 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 13:43:40,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613419218] [2019-12-18 13:43:40,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:40,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:43:40,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157134500] [2019-12-18 13:43:40,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:43:40,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:40,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:43:40,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:43:40,308 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-18 13:43:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:40,356 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-12-18 13:43:40,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:43:40,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 13:43:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:40,392 INFO L225 Difference]: With dead ends: 10750 [2019-12-18 13:43:40,392 INFO L226 Difference]: Without dead ends: 10750 [2019-12-18 13:43:40,392 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 13:43:40,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-12-18 13:43:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-12-18 13:43:40,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-12-18 13:43:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-12-18 13:43:40,800 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-12-18 13:43:40,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:40,800 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-12-18 13:43:40,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:43:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-12-18 13:43:40,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:43:40,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:40,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:43:40,804 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:40,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:40,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-12-18 13:43:40,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:40,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761371126] [2019-12-18 13:43:40,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:40,878 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 13:43:40,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761371126] [2019-12-18 13:43:40,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:40,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:43:40,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099565943] [2019-12-18 13:43:40,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:43:40,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:40,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:43:40,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:43:40,880 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 4 states. [2019-12-18 13:43:40,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:40,912 INFO L93 Difference]: Finished difference Result 2054 states and 5113 transitions. [2019-12-18 13:43:40,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:43:40,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:43:40,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:40,915 INFO L225 Difference]: With dead ends: 2054 [2019-12-18 13:43:40,915 INFO L226 Difference]: Without dead ends: 1457 [2019-12-18 13:43:40,916 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 13:43:40,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-12-18 13:43:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2019-12-18 13:43:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2019-12-18 13:43:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 3211 transitions. [2019-12-18 13:43:40,941 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 3211 transitions. Word has length 16 [2019-12-18 13:43:40,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:40,941 INFO L462 AbstractCegarLoop]: Abstraction has 1457 states and 3211 transitions. [2019-12-18 13:43:40,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:43:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 3211 transitions. [2019-12-18 13:43:40,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 13:43:40,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:40,943 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] [2019-12-18 13:43:40,944 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:40,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:40,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-18 13:43:40,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:40,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466321199] [2019-12-18 13:43:40,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:41,033 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 13:43:41,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466321199] [2019-12-18 13:43:41,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:41,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:43:41,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205608413] [2019-12-18 13:43:41,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:43:41,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:41,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:43:41,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:43:41,037 INFO L87 Difference]: Start difference. First operand 1457 states and 3211 transitions. Second operand 6 states. [2019-12-18 13:43:41,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:41,396 INFO L93 Difference]: Finished difference Result 2249 states and 4761 transitions. [2019-12-18 13:43:41,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:43:41,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 13:43:41,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:41,400 INFO L225 Difference]: With dead ends: 2249 [2019-12-18 13:43:41,401 INFO L226 Difference]: Without dead ends: 2197 [2019-12-18 13:43:41,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:43:41,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2019-12-18 13:43:41,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1428. [2019-12-18 13:43:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-18 13:43:41,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3147 transitions. [2019-12-18 13:43:41,430 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3147 transitions. Word has length 24 [2019-12-18 13:43:41,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:41,431 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 3147 transitions. [2019-12-18 13:43:41,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:43:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3147 transitions. [2019-12-18 13:43:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:43:41,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:41,433 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] [2019-12-18 13:43:41,433 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:41,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:41,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-18 13:43:41,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:41,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567715276] [2019-12-18 13:43:41,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:41,521 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 13:43:41,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567715276] [2019-12-18 13:43:41,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:41,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:43:41,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995009544] [2019-12-18 13:43:41,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:43:41,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:41,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:43:41,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:43:41,523 INFO L87 Difference]: Start difference. First operand 1428 states and 3147 transitions. Second operand 5 states. [2019-12-18 13:43:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:41,569 INFO L93 Difference]: Finished difference Result 752 states and 1639 transitions. [2019-12-18 13:43:41,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:43:41,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 13:43:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:41,571 INFO L225 Difference]: With dead ends: 752 [2019-12-18 13:43:41,571 INFO L226 Difference]: Without dead ends: 689 [2019-12-18 13:43:41,572 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 13:43:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-12-18 13:43:41,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-12-18 13:43:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-12-18 13:43:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-12-18 13:43:41,584 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 27 [2019-12-18 13:43:41,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:41,584 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-12-18 13:43:41,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:43:41,585 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-12-18 13:43:41,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:43:41,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:41,590 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] [2019-12-18 13:43:41,591 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:41,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:41,591 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-12-18 13:43:41,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:41,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732057273] [2019-12-18 13:43:41,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:43:41,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732057273] [2019-12-18 13:43:41,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:41,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:43:41,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102290478] [2019-12-18 13:43:41,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:43:41,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:41,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:43:41,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:43:41,743 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 4 states. [2019-12-18 13:43:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:41,760 INFO L93 Difference]: Finished difference Result 1118 states and 2458 transitions. [2019-12-18 13:43:41,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:43:41,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-18 13:43:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:41,762 INFO L225 Difference]: With dead ends: 1118 [2019-12-18 13:43:41,762 INFO L226 Difference]: Without dead ends: 471 [2019-12-18 13:43:41,762 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 13:43:41,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-18 13:43:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2019-12-18 13:43:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-12-18 13:43:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1036 transitions. [2019-12-18 13:43:41,771 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1036 transitions. Word has length 51 [2019-12-18 13:43:41,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:41,773 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 1036 transitions. [2019-12-18 13:43:41,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:43:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1036 transitions. [2019-12-18 13:43:41,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:43:41,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:41,775 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] [2019-12-18 13:43:41,775 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:41,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:41,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1382412251, now seen corresponding path program 2 times [2019-12-18 13:43:41,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:41,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854604624] [2019-12-18 13:43:41,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:41,948 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 13:43:41,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854604624] [2019-12-18 13:43:41,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:41,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:43:41,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218548830] [2019-12-18 13:43:41,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:43:41,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:41,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:43:41,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:43:41,951 INFO L87 Difference]: Start difference. First operand 471 states and 1036 transitions. Second operand 7 states. [2019-12-18 13:43:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:42,137 INFO L93 Difference]: Finished difference Result 982 states and 2086 transitions. [2019-12-18 13:43:42,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:43:42,138 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 13:43:42,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:42,140 INFO L225 Difference]: With dead ends: 982 [2019-12-18 13:43:42,140 INFO L226 Difference]: Without dead ends: 683 [2019-12-18 13:43:42,141 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 13:43:42,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-18 13:43:42,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 529. [2019-12-18 13:43:42,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-18 13:43:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1137 transitions. [2019-12-18 13:43:42,150 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1137 transitions. Word has length 51 [2019-12-18 13:43:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:42,151 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1137 transitions. [2019-12-18 13:43:42,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:43:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1137 transitions. [2019-12-18 13:43:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:43:42,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:42,153 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] [2019-12-18 13:43:42,153 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:42,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:42,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1158154681, now seen corresponding path program 3 times [2019-12-18 13:43:42,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:42,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656970180] [2019-12-18 13:43:42,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:42,236 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 13:43:42,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656970180] [2019-12-18 13:43:42,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:42,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:43:42,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897813115] [2019-12-18 13:43:42,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:43:42,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:42,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:43:42,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:43:42,238 INFO L87 Difference]: Start difference. First operand 529 states and 1137 transitions. Second operand 5 states. [2019-12-18 13:43:42,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:42,646 INFO L93 Difference]: Finished difference Result 885 states and 1849 transitions. [2019-12-18 13:43:42,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:43:42,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-18 13:43:42,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:42,649 INFO L225 Difference]: With dead ends: 885 [2019-12-18 13:43:42,650 INFO L226 Difference]: Without dead ends: 861 [2019-12-18 13:43:42,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:43:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-12-18 13:43:42,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 712. [2019-12-18 13:43:42,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-12-18 13:43:42,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1532 transitions. [2019-12-18 13:43:42,662 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1532 transitions. Word has length 51 [2019-12-18 13:43:42,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:42,662 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 1532 transitions. [2019-12-18 13:43:42,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:43:42,663 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1532 transitions. [2019-12-18 13:43:42,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:43:42,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:42,665 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] [2019-12-18 13:43:42,665 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:42,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:42,665 INFO L82 PathProgramCache]: Analyzing trace with hash -320603405, now seen corresponding path program 4 times [2019-12-18 13:43:42,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:42,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362692837] [2019-12-18 13:43:42,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:43:42,738 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 13:43:42,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362692837] [2019-12-18 13:43:42,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:43:42,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:43:42,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164548097] [2019-12-18 13:43:42,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:43:42,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:43:42,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:43:42,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:43:42,740 INFO L87 Difference]: Start difference. First operand 712 states and 1532 transitions. Second operand 3 states. [2019-12-18 13:43:42,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:43:42,791 INFO L93 Difference]: Finished difference Result 923 states and 1980 transitions. [2019-12-18 13:43:42,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:43:42,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 13:43:42,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:43:42,792 INFO L225 Difference]: With dead ends: 923 [2019-12-18 13:43:42,792 INFO L226 Difference]: Without dead ends: 923 [2019-12-18 13:43:42,793 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 13:43:42,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-12-18 13:43:42,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 754. [2019-12-18 13:43:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-18 13:43:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-18 13:43:42,804 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-18 13:43:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:43:42,804 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-18 13:43:42,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:43:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-18 13:43:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:43:42,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:43:42,806 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 13:43:42,806 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:43:42,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:43:42,806 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-18 13:43:42,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:43:42,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009187857] [2019-12-18 13:43:42,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:43:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:43:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:43:42,946 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:43:42,947 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:43:42,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1293~0.base_40| 4) |v_#length_17|) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_ULTIMATE.start_main_~#t1293~0.offset_27| 0) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= v_~y$read_delayed~0_6 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1293~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1293~0.base_40|) |v_ULTIMATE.start_main_~#t1293~0.offset_27| 0))) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1293~0.base_40|)) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1293~0.base_40| 1)) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1293~0.base_40|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1293~0.offset=|v_ULTIMATE.start_main_~#t1293~0.offset_27|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t1294~0.base=|v_ULTIMATE.start_main_~#t1294~0.base_41|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t1293~0.base=|v_ULTIMATE.start_main_~#t1293~0.base_40|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ULTIMATE.start_main_~#t1294~0.offset=|v_ULTIMATE.start_main_~#t1294~0.offset_27|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1293~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1294~0.base, #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_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1293~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1294~0.offset, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #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 13:43:42,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1294~0.base_13|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1294~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1294~0.base_13|) |v_ULTIMATE.start_main_~#t1294~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1294~0.base_13| 4) |v_#length_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1294~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1294~0.base_13|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1294~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1294~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1294~0.offset=|v_ULTIMATE.start_main_~#t1294~0.offset_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1294~0.base=|v_ULTIMATE.start_main_~#t1294~0.base_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1294~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1294~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 13:43:42,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1533145711)) (= ~y$r_buff1_thd2~0_Out-1533145711 ~y$r_buff0_thd2~0_In-1533145711) (= ~y$r_buff0_thd1~0_In-1533145711 ~y$r_buff1_thd1~0_Out-1533145711) (= ~x~0_In-1533145711 ~__unbuffered_p0_EAX~0_Out-1533145711) (= ~y$r_buff0_thd1~0_Out-1533145711 1) (= ~y$r_buff0_thd0~0_In-1533145711 ~y$r_buff1_thd0~0_Out-1533145711)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1533145711, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1533145711, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1533145711, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1533145711, ~x~0=~x~0_In-1533145711} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1533145711, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1533145711, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1533145711, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1533145711, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1533145711, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1533145711, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1533145711, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1533145711, ~x~0=~x~0_In-1533145711} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 13:43:42,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In451397188 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In451397188 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out451397188| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out451397188| ~y$w_buff0_used~0_In451397188)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In451397188, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In451397188} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out451397188|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In451397188, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In451397188} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:43:42,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In932941081 256) 0))) (or (and (= ~y$w_buff0_used~0_In932941081 |P1Thread1of1ForFork1_#t~ite20_Out932941081|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In932941081 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In932941081 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In932941081 256))) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In932941081 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite21_Out932941081| |P1Thread1of1ForFork1_#t~ite20_Out932941081|) .cse1) (and (= ~y$w_buff0_used~0_In932941081 |P1Thread1of1ForFork1_#t~ite21_Out932941081|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In932941081| |P1Thread1of1ForFork1_#t~ite20_Out932941081|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In932941081, ~y$w_buff0_used~0=~y$w_buff0_used~0_In932941081, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In932941081|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In932941081, ~weak$$choice2~0=~weak$$choice2~0_In932941081, ~y$w_buff1_used~0=~y$w_buff1_used~0_In932941081} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In932941081, ~y$w_buff0_used~0=~y$w_buff0_used~0_In932941081, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out932941081|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In932941081, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out932941081|, ~weak$$choice2~0=~weak$$choice2~0_In932941081, ~y$w_buff1_used~0=~y$w_buff1_used~0_In932941081} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 13:43:42,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In788628968 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In788628968 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In788628968 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out788628968| |P1Thread1of1ForFork1_#t~ite23_Out788628968|)) (.cse5 (= (mod ~y$r_buff1_thd2~0_In788628968 256) 0)) (.cse4 (= 0 (mod ~y$r_buff0_thd2~0_In788628968 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In788628968| |P1Thread1of1ForFork1_#t~ite22_Out788628968|) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In788628968| |P1Thread1of1ForFork1_#t~ite23_Out788628968|) (= ~y$w_buff1_used~0_In788628968 |P1Thread1of1ForFork1_#t~ite24_Out788628968|)) (and .cse0 (= ~y$w_buff1_used~0_In788628968 |P1Thread1of1ForFork1_#t~ite23_Out788628968|) .cse1 (or .cse2 (and .cse3 .cse4) (and .cse5 .cse4))))) (let ((.cse6 (not .cse4))) (and (= |P1Thread1of1ForFork1_#t~ite23_Out788628968| |P1Thread1of1ForFork1_#t~ite22_Out788628968|) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out788628968|) (or .cse6 (not .cse3)) .cse0 (not .cse2) .cse1 (or (not .cse5) .cse6))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In788628968, ~y$w_buff0_used~0=~y$w_buff0_used~0_In788628968, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In788628968, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In788628968|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In788628968|, ~weak$$choice2~0=~weak$$choice2~0_In788628968, ~y$w_buff1_used~0=~y$w_buff1_used~0_In788628968} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In788628968, ~y$w_buff0_used~0=~y$w_buff0_used~0_In788628968, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In788628968, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out788628968|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out788628968|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out788628968|, ~weak$$choice2~0=~weak$$choice2~0_In788628968, ~y$w_buff1_used~0=~y$w_buff1_used~0_In788628968} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 13:43:42,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In1083089849 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1083089849 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1083089849 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1083089849 256) 0))) (or (and (= ~y$w_buff1_used~0_In1083089849 |P0Thread1of1ForFork0_#t~ite6_Out1083089849|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1083089849|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1083089849, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1083089849, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1083089849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1083089849} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1083089849|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1083089849, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1083089849, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1083089849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1083089849} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:43:42,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2120379717 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-2120379717 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out-2120379717 0)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_Out-2120379717 ~y$r_buff0_thd1~0_In-2120379717)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120379717, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2120379717} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120379717, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2120379717|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2120379717} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:43:42,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In650989922 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In650989922 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In650989922 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In650989922 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out650989922| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out650989922| ~y$r_buff1_thd1~0_In650989922) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In650989922, ~y$w_buff0_used~0=~y$w_buff0_used~0_In650989922, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In650989922, ~y$w_buff1_used~0=~y$w_buff1_used~0_In650989922} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In650989922, ~y$w_buff0_used~0=~y$w_buff0_used~0_In650989922, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out650989922|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In650989922, ~y$w_buff1_used~0=~y$w_buff1_used~0_In650989922} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:43:42,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 13:43:42,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1624043241 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1624043241| |P1Thread1of1ForFork1_#t~ite29_Out-1624043241|) (= ~y$r_buff1_thd2~0_In-1624043241 |P1Thread1of1ForFork1_#t~ite30_Out-1624043241|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1624043241| ~y$r_buff1_thd2~0_In-1624043241) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-1624043241| |P1Thread1of1ForFork1_#t~ite30_Out-1624043241|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1624043241 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1624043241 256))) (= (mod ~y$w_buff0_used~0_In-1624043241 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1624043241 256)))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1624043241, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1624043241|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1624043241, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1624043241, ~weak$$choice2~0=~weak$$choice2~0_In-1624043241, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1624043241} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1624043241, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1624043241|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1624043241|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1624043241, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1624043241, ~weak$$choice2~0=~weak$$choice2~0_In-1624043241, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1624043241} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 13:43:42,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} 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_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 13:43:42,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1867225653 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1867225653 256) 0))) (or (and (= ~y~0_In-1867225653 |P1Thread1of1ForFork1_#t~ite32_Out-1867225653|) (or .cse0 .cse1)) (and (= ~y$w_buff1~0_In-1867225653 |P1Thread1of1ForFork1_#t~ite32_Out-1867225653|) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1867225653, ~y$w_buff1~0=~y$w_buff1~0_In-1867225653, ~y~0=~y~0_In-1867225653, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1867225653} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1867225653, ~y$w_buff1~0=~y$w_buff1~0_In-1867225653, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1867225653|, ~y~0=~y~0_In-1867225653, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1867225653} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 13:43:42,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 13:43:42,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1895333427 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1895333427 256)))) (or (and (= ~y$w_buff0_used~0_In-1895333427 |P1Thread1of1ForFork1_#t~ite34_Out-1895333427|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1895333427| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1895333427, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1895333427} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1895333427, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1895333427, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1895333427|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 13:43:42,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In905934492 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In905934492 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In905934492 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In905934492 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out905934492| ~y$w_buff1_used~0_In905934492)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out905934492| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In905934492, ~y$w_buff0_used~0=~y$w_buff0_used~0_In905934492, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In905934492, ~y$w_buff1_used~0=~y$w_buff1_used~0_In905934492} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In905934492, ~y$w_buff0_used~0=~y$w_buff0_used~0_In905934492, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In905934492, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out905934492|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In905934492} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 13:43:42,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1299622429 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1299622429 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1299622429|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1299622429| ~y$r_buff0_thd2~0_In-1299622429)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1299622429, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1299622429} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1299622429, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1299622429, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1299622429|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 13:43:42,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-437546240 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-437546240 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-437546240 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-437546240 256)))) (or (and (= ~y$r_buff1_thd2~0_In-437546240 |P1Thread1of1ForFork1_#t~ite37_Out-437546240|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-437546240|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-437546240, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-437546240, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-437546240, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-437546240} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-437546240, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-437546240, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-437546240, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-437546240|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-437546240} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:43:42,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} 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 13:43:42,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} 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 13:43:42,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 13:43:42,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1140930159 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1140930159 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1140930159| ~y$w_buff1~0_In1140930159)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1140930159| ~y~0_In1140930159)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1140930159, ~y~0=~y~0_In1140930159, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1140930159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1140930159} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1140930159|, ~y$w_buff1~0=~y$w_buff1~0_In1140930159, ~y~0=~y~0_In1140930159, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1140930159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1140930159} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 13:43:42,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 13:43:42,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1317993873 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1317993873 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1317993873 |ULTIMATE.start_main_#t~ite42_Out-1317993873|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1317993873|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1317993873, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1317993873} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1317993873, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1317993873, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1317993873|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:43:42,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1409649730 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1409649730 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1409649730 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1409649730 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1409649730| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite43_Out1409649730| ~y$w_buff1_used~0_In1409649730) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1409649730, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1409649730, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1409649730, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1409649730} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1409649730, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1409649730, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1409649730|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1409649730, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1409649730} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 13:43:42,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1289833241 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1289833241 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1289833241| ~y$r_buff0_thd0~0_In-1289833241) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1289833241| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1289833241, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1289833241} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1289833241, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1289833241, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1289833241|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:43:42,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1568368494 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1568368494 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1568368494 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1568368494 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1568368494|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In1568368494 |ULTIMATE.start_main_#t~ite45_Out1568368494|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1568368494, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1568368494, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1568368494, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1568368494} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1568368494, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1568368494, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1568368494, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1568368494|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1568368494} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:43:42,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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 13:43:43,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:43:43 BasicIcfg [2019-12-18 13:43:43,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:43:43,070 INFO L168 Benchmark]: Toolchain (without parser) took 13689.58 ms. Allocated memory was 136.8 MB in the beginning and 578.3 MB in the end (delta: 441.5 MB). Free memory was 100.6 MB in the beginning and 299.9 MB in the end (delta: -199.3 MB). Peak memory consumption was 242.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:43,071 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:43:43,072 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.72 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 100.4 MB in the beginning and 154.7 MB in the end (delta: -54.3 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:43,073 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.28 ms. Allocated memory is still 200.3 MB. Free memory was 154.7 MB in the beginning and 151.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:43,074 INFO L168 Benchmark]: Boogie Preprocessor took 37.27 ms. Allocated memory is still 200.3 MB. Free memory was 151.9 MB in the beginning and 149.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:43,074 INFO L168 Benchmark]: RCFGBuilder took 760.79 ms. Allocated memory is still 200.3 MB. Free memory was 149.9 MB in the beginning and 105.4 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:43,075 INFO L168 Benchmark]: TraceAbstraction took 12063.07 ms. Allocated memory was 200.3 MB in the beginning and 578.3 MB in the end (delta: 378.0 MB). Free memory was 104.7 MB in the beginning and 299.9 MB in the end (delta: -195.2 MB). Peak memory consumption was 182.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:43:43,080 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.51 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 761.72 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 100.4 MB in the beginning and 154.7 MB in the end (delta: -54.3 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.28 ms. Allocated memory is still 200.3 MB. Free memory was 154.7 MB in the beginning and 151.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.27 ms. Allocated memory is still 200.3 MB. Free memory was 151.9 MB in the beginning and 149.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 760.79 ms. Allocated memory is still 200.3 MB. Free memory was 149.9 MB in the beginning and 105.4 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12063.07 ms. Allocated memory was 200.3 MB in the beginning and 578.3 MB in the end (delta: 378.0 MB). Free memory was 104.7 MB in the beginning and 299.9 MB in the end (delta: -195.2 MB). Peak memory consumption was 182.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1293, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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 [L796] FCALL, FORK 0 pthread_create(&t1294, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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=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 = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L759] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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) [L759] 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) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_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))=1, x=1, 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] [L760] 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)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_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))=0, x=1, 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] [L761] 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)) [L762] 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)) [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$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)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=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] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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 [L805] 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: 11.7s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1295 SDtfs, 1438 SDslu, 2194 SDs, 0 SdLazy, 1138 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred 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: 1.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 5640 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 33998 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...