/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:23:54,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:23:54,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:23:54,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:23:54,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:23:54,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:23:54,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:23:54,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:23:54,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:23:54,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:23:54,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:23:54,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:23:54,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:23:54,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:23:54,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:23:54,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:23:54,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:23:54,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:23:54,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:23:54,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:23:54,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:23:54,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:23:54,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:23:54,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:23:54,268 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:23:54,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:23:54,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:23:54,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:23:54,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:23:54,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:23:54,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:23:54,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:23:54,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:23:54,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:23:54,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:23:54,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:23:54,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:23:54,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:23:54,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:23:54,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:23:54,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:23:54,277 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:23:54,291 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:23:54,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:23:54,293 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:23:54,293 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:23:54,293 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:23:54,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:23:54,294 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:23:54,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:23:54,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:23:54,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:23:54,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:23:54,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:23:54,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:23:54,295 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:23:54,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:23:54,295 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:23:54,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:23:54,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:23:54,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:23:54,296 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:23:54,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:23:54,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:23:54,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:23:54,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:23:54,297 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:23:54,298 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:23:54,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:23:54,298 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:23:54,298 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:23:54,298 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:23:54,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:23:54,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:23:54,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:23:54,587 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:23:54,588 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:23:54,588 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.opt.i [2019-12-18 21:23:54,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e40ae423/9e65b2eac8164259bba853585cd1d2f5/FLAGacef02f0f [2019-12-18 21:23:55,206 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:23:55,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_pso.opt.i [2019-12-18 21:23:55,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e40ae423/9e65b2eac8164259bba853585cd1d2f5/FLAGacef02f0f [2019-12-18 21:23:55,482 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e40ae423/9e65b2eac8164259bba853585cd1d2f5 [2019-12-18 21:23:55,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:23:55,495 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:23:55,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:23:55,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:23:55,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:23:55,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:23:55" (1/1) ... [2019-12-18 21:23:55,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160dde8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:55, skipping insertion in model container [2019-12-18 21:23:55,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:23:55" (1/1) ... [2019-12-18 21:23:55,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:23:55,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:23:56,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:23:56,123 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:23:56,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:23:56,288 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:23:56,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:56 WrapperNode [2019-12-18 21:23:56,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:23:56,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:23:56,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:23:56,290 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:23:56,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:56" (1/1) ... [2019-12-18 21:23:56,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:56" (1/1) ... [2019-12-18 21:23:56,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:23:56,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:23:56,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:23:56,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:23:56,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:56" (1/1) ... [2019-12-18 21:23:56,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:56" (1/1) ... [2019-12-18 21:23:56,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:56" (1/1) ... [2019-12-18 21:23:56,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:56" (1/1) ... [2019-12-18 21:23:56,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:56" (1/1) ... [2019-12-18 21:23:56,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:56" (1/1) ... [2019-12-18 21:23:56,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:56" (1/1) ... [2019-12-18 21:23:56,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:23:56,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:23:56,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:23:56,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:23:56,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:56" (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 21:23:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:23:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:23:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:23:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:23:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:23:56,468 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:23:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:23:56,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:23:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:23:56,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:23:56,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:23:56,472 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 21:23:57,174 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:23:57,174 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:23:57,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:23:57 BoogieIcfgContainer [2019-12-18 21:23:57,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:23:57,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:23:57,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:23:57,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:23:57,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:23:55" (1/3) ... [2019-12-18 21:23:57,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7920e022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:23:57, skipping insertion in model container [2019-12-18 21:23:57,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:56" (2/3) ... [2019-12-18 21:23:57,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7920e022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:23:57, skipping insertion in model container [2019-12-18 21:23:57,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:23:57" (3/3) ... [2019-12-18 21:23:57,185 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_pso.opt.i [2019-12-18 21:23:57,197 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:23:57,197 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:23:57,206 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:23:57,207 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:23:57,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,248 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,248 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,259 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,259 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,259 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,281 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,281 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,286 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,286 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,286 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:57,306 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:23:57,332 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:23:57,332 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:23:57,333 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:23:57,333 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:23:57,333 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:23:57,333 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:23:57,333 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:23:57,334 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:23:57,360 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 21:23:57,363 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 21:23:57,510 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 21:23:57,510 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:23:57,530 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:23:57,548 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 21:23:57,625 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 21:23:57,625 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:23:57,632 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:23:57,652 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 21:23:57,654 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:24:00,770 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 21:24:00,899 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 21:24:00,921 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48474 [2019-12-18 21:24:00,922 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-18 21:24:00,925 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 92 transitions [2019-12-18 21:24:01,405 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9180 states. [2019-12-18 21:24:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states. [2019-12-18 21:24:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 21:24:01,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:01,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 21:24:01,416 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:01,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:01,421 INFO L82 PathProgramCache]: Analyzing trace with hash 695759593, now seen corresponding path program 1 times [2019-12-18 21:24:01,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:01,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286160597] [2019-12-18 21:24:01,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:01,682 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 21:24:01,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286160597] [2019-12-18 21:24:01,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:01,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:24:01,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267472002] [2019-12-18 21:24:01,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:24:01,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:01,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:24:01,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:01,710 INFO L87 Difference]: Start difference. First operand 9180 states. Second operand 3 states. [2019-12-18 21:24:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:01,998 INFO L93 Difference]: Finished difference Result 9090 states and 29695 transitions. [2019-12-18 21:24:01,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:24:02,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 21:24:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:02,108 INFO L225 Difference]: With dead ends: 9090 [2019-12-18 21:24:02,109 INFO L226 Difference]: Without dead ends: 8908 [2019-12-18 21:24:02,110 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 21:24:02,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8908 states. [2019-12-18 21:24:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8908 to 8908. [2019-12-18 21:24:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8908 states. [2019-12-18 21:24:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8908 states to 8908 states and 29136 transitions. [2019-12-18 21:24:02,609 INFO L78 Accepts]: Start accepts. Automaton has 8908 states and 29136 transitions. Word has length 5 [2019-12-18 21:24:02,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:02,609 INFO L462 AbstractCegarLoop]: Abstraction has 8908 states and 29136 transitions. [2019-12-18 21:24:02,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:24:02,610 INFO L276 IsEmpty]: Start isEmpty. Operand 8908 states and 29136 transitions. [2019-12-18 21:24:02,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:24:02,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:02,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:02,613 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:02,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:02,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1035576107, now seen corresponding path program 1 times [2019-12-18 21:24:02,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:02,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559591524] [2019-12-18 21:24:02,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:02,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 21:24:02,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559591524] [2019-12-18 21:24:02,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:02,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:24:02,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6796143] [2019-12-18 21:24:02,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:24:02,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:02,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:24:02,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:24:02,747 INFO L87 Difference]: Start difference. First operand 8908 states and 29136 transitions. Second operand 4 states. [2019-12-18 21:24:03,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:03,222 INFO L93 Difference]: Finished difference Result 14155 states and 44019 transitions. [2019-12-18 21:24:03,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:24:03,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:24:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:03,871 INFO L225 Difference]: With dead ends: 14155 [2019-12-18 21:24:03,871 INFO L226 Difference]: Without dead ends: 14148 [2019-12-18 21:24:03,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 21:24:03,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14148 states. [2019-12-18 21:24:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14148 to 12754. [2019-12-18 21:24:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12754 states. [2019-12-18 21:24:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12754 states to 12754 states and 40283 transitions. [2019-12-18 21:24:04,296 INFO L78 Accepts]: Start accepts. Automaton has 12754 states and 40283 transitions. Word has length 11 [2019-12-18 21:24:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:04,296 INFO L462 AbstractCegarLoop]: Abstraction has 12754 states and 40283 transitions. [2019-12-18 21:24:04,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:24:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 12754 states and 40283 transitions. [2019-12-18 21:24:04,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:24:04,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:04,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:04,301 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:04,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:04,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1185448960, now seen corresponding path program 1 times [2019-12-18 21:24:04,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:04,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417030819] [2019-12-18 21:24:04,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:04,374 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 21:24:04,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417030819] [2019-12-18 21:24:04,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:04,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:24:04,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405698807] [2019-12-18 21:24:04,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:24:04,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:04,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:24:04,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:24:04,377 INFO L87 Difference]: Start difference. First operand 12754 states and 40283 transitions. Second operand 4 states. [2019-12-18 21:24:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:04,419 INFO L93 Difference]: Finished difference Result 2009 states and 4645 transitions. [2019-12-18 21:24:04,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:24:04,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:24:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:04,425 INFO L225 Difference]: With dead ends: 2009 [2019-12-18 21:24:04,425 INFO L226 Difference]: Without dead ends: 1723 [2019-12-18 21:24:04,426 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 21:24:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2019-12-18 21:24:04,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1723. [2019-12-18 21:24:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-12-18 21:24:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 3854 transitions. [2019-12-18 21:24:04,467 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 3854 transitions. Word has length 11 [2019-12-18 21:24:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:04,467 INFO L462 AbstractCegarLoop]: Abstraction has 1723 states and 3854 transitions. [2019-12-18 21:24:04,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:24:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 3854 transitions. [2019-12-18 21:24:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 21:24:04,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:04,470 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] [2019-12-18 21:24:04,470 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:04,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:04,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1819811138, now seen corresponding path program 1 times [2019-12-18 21:24:04,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:04,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136901317] [2019-12-18 21:24:04,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:04,613 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 21:24:04,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136901317] [2019-12-18 21:24:04,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:04,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:24:04,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517806839] [2019-12-18 21:24:04,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:24:04,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:04,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:24:04,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:24:04,619 INFO L87 Difference]: Start difference. First operand 1723 states and 3854 transitions. Second operand 5 states. [2019-12-18 21:24:04,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:04,679 INFO L93 Difference]: Finished difference Result 403 states and 750 transitions. [2019-12-18 21:24:04,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:24:04,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-18 21:24:04,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:04,683 INFO L225 Difference]: With dead ends: 403 [2019-12-18 21:24:04,683 INFO L226 Difference]: Without dead ends: 357 [2019-12-18 21:24:04,683 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 21:24:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-18 21:24:04,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2019-12-18 21:24:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-18 21:24:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 595 transitions. [2019-12-18 21:24:04,693 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 595 transitions. Word has length 23 [2019-12-18 21:24:04,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:04,693 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 595 transitions. [2019-12-18 21:24:04,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:24:04,694 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 595 transitions. [2019-12-18 21:24:04,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:24:04,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:04,696 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 21:24:04,696 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:04,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:04,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1711535056, now seen corresponding path program 1 times [2019-12-18 21:24:04,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:04,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449139851] [2019-12-18 21:24:04,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:04,849 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 21:24:04,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449139851] [2019-12-18 21:24:04,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:04,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:24:04,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932035661] [2019-12-18 21:24:04,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:24:04,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:04,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:24:04,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:04,852 INFO L87 Difference]: Start difference. First operand 322 states and 595 transitions. Second operand 3 states. [2019-12-18 21:24:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:04,903 INFO L93 Difference]: Finished difference Result 333 states and 611 transitions. [2019-12-18 21:24:04,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:24:04,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:24:04,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:04,905 INFO L225 Difference]: With dead ends: 333 [2019-12-18 21:24:04,905 INFO L226 Difference]: Without dead ends: 333 [2019-12-18 21:24:04,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:04,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-18 21:24:04,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2019-12-18 21:24:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-18 21:24:04,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 607 transitions. [2019-12-18 21:24:04,912 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 607 transitions. Word has length 52 [2019-12-18 21:24:04,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:04,913 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 607 transitions. [2019-12-18 21:24:04,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:24:04,913 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 607 transitions. [2019-12-18 21:24:04,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:24:04,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:04,915 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 21:24:04,915 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:04,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:04,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2008413200, now seen corresponding path program 1 times [2019-12-18 21:24:04,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:04,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023959596] [2019-12-18 21:24:04,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:04,979 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 21:24:04,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023959596] [2019-12-18 21:24:04,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:04,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:24:04,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149011584] [2019-12-18 21:24:04,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:24:04,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:04,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:24:04,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:04,982 INFO L87 Difference]: Start difference. First operand 329 states and 607 transitions. Second operand 3 states. [2019-12-18 21:24:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:04,998 INFO L93 Difference]: Finished difference Result 329 states and 594 transitions. [2019-12-18 21:24:04,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:24:04,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:24:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:05,000 INFO L225 Difference]: With dead ends: 329 [2019-12-18 21:24:05,000 INFO L226 Difference]: Without dead ends: 329 [2019-12-18 21:24:05,000 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 21:24:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-12-18 21:24:05,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2019-12-18 21:24:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-18 21:24:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 594 transitions. [2019-12-18 21:24:05,007 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 594 transitions. Word has length 52 [2019-12-18 21:24:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:05,008 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 594 transitions. [2019-12-18 21:24:05,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:24:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 594 transitions. [2019-12-18 21:24:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:24:05,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:05,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:05,011 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:05,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:05,011 INFO L82 PathProgramCache]: Analyzing trace with hash -440282734, now seen corresponding path program 1 times [2019-12-18 21:24:05,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:05,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660671205] [2019-12-18 21:24:05,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:05,197 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 21:24:05,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660671205] [2019-12-18 21:24:05,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:05,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:24:05,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118528798] [2019-12-18 21:24:05,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:24:05,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:05,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:24:05,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:24:05,200 INFO L87 Difference]: Start difference. First operand 329 states and 594 transitions. Second operand 8 states. [2019-12-18 21:24:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:05,712 INFO L93 Difference]: Finished difference Result 520 states and 925 transitions. [2019-12-18 21:24:05,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:24:05,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-18 21:24:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:05,714 INFO L225 Difference]: With dead ends: 520 [2019-12-18 21:24:05,714 INFO L226 Difference]: Without dead ends: 520 [2019-12-18 21:24:05,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:24:05,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-12-18 21:24:05,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 374. [2019-12-18 21:24:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-12-18 21:24:05,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 676 transitions. [2019-12-18 21:24:05,728 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 676 transitions. Word has length 53 [2019-12-18 21:24:05,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:05,729 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 676 transitions. [2019-12-18 21:24:05,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:24:05,729 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 676 transitions. [2019-12-18 21:24:05,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:24:05,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:05,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:05,731 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:05,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:05,731 INFO L82 PathProgramCache]: Analyzing trace with hash 783878168, now seen corresponding path program 2 times [2019-12-18 21:24:05,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:05,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068886099] [2019-12-18 21:24:05,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:05,810 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 21:24:05,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068886099] [2019-12-18 21:24:05,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:05,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:24:05,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065996001] [2019-12-18 21:24:05,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:24:05,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:05,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:24:05,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:05,813 INFO L87 Difference]: Start difference. First operand 374 states and 676 transitions. Second operand 3 states. [2019-12-18 21:24:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:05,865 INFO L93 Difference]: Finished difference Result 373 states and 674 transitions. [2019-12-18 21:24:05,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:24:05,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 21:24:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:05,868 INFO L225 Difference]: With dead ends: 373 [2019-12-18 21:24:05,868 INFO L226 Difference]: Without dead ends: 373 [2019-12-18 21:24:05,868 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 21:24:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-12-18 21:24:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 276. [2019-12-18 21:24:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-12-18 21:24:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 493 transitions. [2019-12-18 21:24:05,874 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 493 transitions. Word has length 53 [2019-12-18 21:24:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:05,875 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 493 transitions. [2019-12-18 21:24:05,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:24:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 493 transitions. [2019-12-18 21:24:05,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:24:05,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:05,876 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:05,877 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:05,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:05,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1094441083, now seen corresponding path program 1 times [2019-12-18 21:24:05,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:05,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135593912] [2019-12-18 21:24:05,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:06,260 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 21:24:06,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135593912] [2019-12-18 21:24:06,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:06,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:24:06,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291322631] [2019-12-18 21:24:06,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:24:06,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:06,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:24:06,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:24:06,262 INFO L87 Difference]: Start difference. First operand 276 states and 493 transitions. Second operand 13 states. [2019-12-18 21:24:06,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:06,862 INFO L93 Difference]: Finished difference Result 611 states and 1094 transitions. [2019-12-18 21:24:06,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 21:24:06,862 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 21:24:06,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:06,864 INFO L225 Difference]: With dead ends: 611 [2019-12-18 21:24:06,864 INFO L226 Difference]: Without dead ends: 296 [2019-12-18 21:24:06,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:24:06,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-18 21:24:06,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 267. [2019-12-18 21:24:06,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-12-18 21:24:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 457 transitions. [2019-12-18 21:24:06,871 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 457 transitions. Word has length 54 [2019-12-18 21:24:06,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:06,871 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 457 transitions. [2019-12-18 21:24:06,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:24:06,872 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 457 transitions. [2019-12-18 21:24:06,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:24:06,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:06,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:06,873 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:06,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:06,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1737208453, now seen corresponding path program 2 times [2019-12-18 21:24:06,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:06,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394337968] [2019-12-18 21:24:06,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:07,108 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 21:24:07,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394337968] [2019-12-18 21:24:07,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:07,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:24:07,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53519365] [2019-12-18 21:24:07,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:24:07,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:07,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:24:07,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:24:07,110 INFO L87 Difference]: Start difference. First operand 267 states and 457 transitions. Second operand 12 states. [2019-12-18 21:24:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:07,695 INFO L93 Difference]: Finished difference Result 410 states and 683 transitions. [2019-12-18 21:24:07,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:24:07,696 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-18 21:24:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:07,697 INFO L225 Difference]: With dead ends: 410 [2019-12-18 21:24:07,697 INFO L226 Difference]: Without dead ends: 222 [2019-12-18 21:24:07,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:24:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-18 21:24:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2019-12-18 21:24:07,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-18 21:24:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 341 transitions. [2019-12-18 21:24:07,703 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 341 transitions. Word has length 54 [2019-12-18 21:24:07,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:07,703 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 341 transitions. [2019-12-18 21:24:07,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:24:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 341 transitions. [2019-12-18 21:24:07,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:24:07,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:07,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:07,704 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:07,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:07,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1606647941, now seen corresponding path program 3 times [2019-12-18 21:24:07,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:07,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374415519] [2019-12-18 21:24:07,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:24:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:24:07,887 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:24:07,887 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:24:07,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_44| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_19 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd2~0_17 0) (= v_~x$w_buff1_used~0_63 0) (= 0 v_~x$r_buff0_thd2~0_26) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1095~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1095~0.base_20|) |v_ULTIMATE.start_main_~#t1095~0.offset_15| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~x$w_buff1~0_23) (= 0 v_~x$r_buff0_thd1~0_20) (= v_~x~0_28 0) (= |v_ULTIMATE.start_main_~#t1095~0.offset_15| 0) (= v_~x$flush_delayed~0_16 0) (= 0 v_~x$r_buff0_thd0~0_78) (= (store .cse0 |v_ULTIMATE.start_main_~#t1095~0.base_20| 1) |v_#valid_42|) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1095~0.base_20|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1095~0.base_20| 4) |v_#length_17|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1095~0.base_20|) (= |v_#NULL.offset_5| 0) (= 0 v_~y~0_8) (= 0 v_~x$w_buff0_used~0_105) (= 0 v_~z~0_9) (= v_~x$mem_tmp~0_11 0) (= v_~x$r_buff1_thd0~0_45 0) (= 0 v_~weak$$choice0~0_6) (= v_~main$tmp_guard0~0_11 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~weak$$choice2~0_31) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_10 0) (= 0 v_~x$w_buff0~0_28))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_~#t1096~0.offset=|v_ULTIMATE.start_main_~#t1096~0.offset_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ULTIMATE.start_main_~#t1096~0.base=|v_ULTIMATE.start_main_~#t1096~0.base_17|, #length=|v_#length_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ~x$w_buff1~0=v_~x$w_buff1~0_23, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_63, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_15|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~x~0=v_~x~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_12|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ULTIMATE.start_main_~#t1095~0.offset=|v_ULTIMATE.start_main_~#t1095~0.offset_15|, ~y~0=v_~y~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_12|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_45, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_31, ULTIMATE.start_main_~#t1095~0.base=|v_ULTIMATE.start_main_~#t1095~0.base_20|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1096~0.offset, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1096~0.base, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1095~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1095~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 21:24:07,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L789-1-->L791: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1096~0.base_11|) 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1096~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1096~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1096~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1096~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1096~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1096~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1096~0.base_11|) |v_ULTIMATE.start_main_~#t1096~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1096~0.base=|v_ULTIMATE.start_main_~#t1096~0.base_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1096~0.offset=|v_ULTIMATE.start_main_~#t1096~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1096~0.base, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1096~0.offset] because there is no mapped edge [2019-12-18 21:24:07,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] P1ENTRY-->L4-3: Formula: (and (= v_~x$w_buff1_used~0_43 v_~x$w_buff0_used~0_72) (= (mod v_~x$w_buff1_used~0_43 256) 0) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= 2 v_~x$w_buff0~0_15) (= v_~x$w_buff0~0_16 v_~x$w_buff1~0_13) (= 1 v_~x$w_buff0_used~0_71) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 21:24:07,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L732-2-->L732-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out1847585866| |P0Thread1of1ForFork0_#t~ite4_Out1847585866|)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1847585866 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1847585866 256) 0))) (or (and .cse0 (not .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out1847585866| ~x$w_buff1~0_In1847585866) (not .cse2)) (and .cse0 (= ~x~0_In1847585866 |P0Thread1of1ForFork0_#t~ite3_Out1847585866|) (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1847585866, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1847585866, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1847585866, ~x~0=~x~0_In1847585866} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1847585866|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1847585866|, ~x$w_buff1~0=~x$w_buff1~0_In1847585866, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1847585866, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1847585866, ~x~0=~x~0_In1847585866} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 21:24:07,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-718275363 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-718275363 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-718275363|)) (and (= ~x$w_buff0_used~0_In-718275363 |P0Thread1of1ForFork0_#t~ite5_Out-718275363|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-718275363, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-718275363} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-718275363|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-718275363, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-718275363} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:24:07,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1426683124 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1426683124 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-1426683124 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1426683124 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1426683124|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1426683124| ~x$w_buff1_used~0_In-1426683124) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1426683124, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1426683124, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1426683124, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1426683124} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1426683124|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1426683124, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1426683124, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1426683124, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1426683124} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:24:07,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-773065024 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-773065024 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In-773065024 |P0Thread1of1ForFork0_#t~ite7_Out-773065024|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-773065024|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-773065024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-773065024} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-773065024, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-773065024|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-773065024} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 21:24:07,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L736-->L736-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd1~0_In-919531764 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-919531764 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-919531764 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-919531764 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-919531764| ~x$r_buff1_thd1~0_In-919531764) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-919531764| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-919531764, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-919531764, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-919531764, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-919531764} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-919531764, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-919531764|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-919531764, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-919531764, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-919531764} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:24:07,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L736-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 21:24:07,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1611090483 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1611090483 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1611090483|) (not .cse1)) (and (= ~x$w_buff0_used~0_In1611090483 |P1Thread1of1ForFork1_#t~ite11_Out1611090483|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1611090483, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1611090483} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1611090483|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1611090483, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1611090483} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 21:24:07,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In501932697 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In501932697 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In501932697 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In501932697 256)))) (or (and (= ~x$w_buff1_used~0_In501932697 |P1Thread1of1ForFork1_#t~ite12_Out501932697|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out501932697|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In501932697, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In501932697, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In501932697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In501932697} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In501932697, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In501932697, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out501932697|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In501932697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In501932697} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:24:07,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L769-->L770: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In412074987 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In412074987 256) 0))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out412074987 0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_Out412074987 ~x$r_buff0_thd2~0_In412074987) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In412074987, ~x$w_buff0_used~0=~x$w_buff0_used~0_In412074987} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out412074987|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out412074987, ~x$w_buff0_used~0=~x$w_buff0_used~0_In412074987} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 21:24:07,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In2121415727 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In2121415727 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In2121415727 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In2121415727 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out2121415727| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out2121415727| ~x$r_buff1_thd2~0_In2121415727)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2121415727, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2121415727, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2121415727, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2121415727} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2121415727, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2121415727, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2121415727, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2121415727|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2121415727} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:24:07,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L770-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:24:07,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_93 256)) (= 0 (mod v_~x$r_buff0_thd0~0_66 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_66, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_66, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:24:07,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1417630485 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1417630485 256)))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out1417630485| ~x~0_In1417630485) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite17_Out1417630485| ~x$w_buff1~0_In1417630485) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1417630485, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1417630485, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1417630485, ~x~0=~x~0_In1417630485} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1417630485|, ~x$w_buff1~0=~x$w_buff1~0_In1417630485, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1417630485, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1417630485, ~x~0=~x~0_In1417630485} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 21:24:07,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L797-4-->L798: Formula: (= v_~x~0_19 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-18 21:24:07,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In991193568 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In991193568 256) 0))) (or (and (= ~x$w_buff0_used~0_In991193568 |ULTIMATE.start_main_#t~ite19_Out991193568|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out991193568|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In991193568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In991193568} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In991193568, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out991193568|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In991193568} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:24:07,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1833754781 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1833754781 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1833754781 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1833754781 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite20_Out1833754781|)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out1833754781| ~x$w_buff1_used~0_In1833754781) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1833754781, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1833754781, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1833754781, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1833754781} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1833754781, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1833754781, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1833754781|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1833754781, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1833754781} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:24:07,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1982819849 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1982819849 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out1982819849|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out1982819849| ~x$r_buff0_thd0~0_In1982819849)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1982819849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1982819849} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1982819849, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1982819849|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1982819849} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:24:07,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In-450547953 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-450547953 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-450547953 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-450547953 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-450547953|)) (and (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In-450547953 |ULTIMATE.start_main_#t~ite22_Out-450547953|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-450547953, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-450547953, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-450547953, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-450547953} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-450547953, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-450547953, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-450547953, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-450547953|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-450547953} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:24:07,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-165850753 256)))) (or (and (= |ULTIMATE.start_main_#t~ite31_In-165850753| |ULTIMATE.start_main_#t~ite31_Out-165850753|) (not .cse0) (= |ULTIMATE.start_main_#t~ite32_Out-165850753| ~x$w_buff1~0_In-165850753)) (and (= ~x$w_buff1~0_In-165850753 |ULTIMATE.start_main_#t~ite31_Out-165850753|) .cse0 (= |ULTIMATE.start_main_#t~ite32_Out-165850753| |ULTIMATE.start_main_#t~ite31_Out-165850753|) (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-165850753 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd0~0_In-165850753 256)) .cse1) (and (= (mod ~x$w_buff1_used~0_In-165850753 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-165850753 256))))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-165850753, ~x$w_buff1~0=~x$w_buff1~0_In-165850753, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-165850753, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-165850753, ~weak$$choice2~0=~weak$$choice2~0_In-165850753, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-165850753|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-165850753} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-165850753, ~x$w_buff1~0=~x$w_buff1~0_In-165850753, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-165850753, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-165850753|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-165850753, ~weak$$choice2~0=~weak$$choice2~0_In-165850753, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-165850753|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-165850753} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-18 21:24:07,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L812-->L812-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1171515774 256)))) (or (and (= ~x$w_buff1_used~0_In1171515774 |ULTIMATE.start_main_#t~ite37_Out1171515774|) (= |ULTIMATE.start_main_#t~ite37_Out1171515774| |ULTIMATE.start_main_#t~ite38_Out1171515774|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1171515774 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In1171515774 256) 0)) (and (= (mod ~x$r_buff1_thd0~0_In1171515774 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In1171515774 256) 0)))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_In1171515774| |ULTIMATE.start_main_#t~ite37_Out1171515774|) (= ~x$w_buff1_used~0_In1171515774 |ULTIMATE.start_main_#t~ite38_Out1171515774|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1171515774, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1171515774, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In1171515774|, ~weak$$choice2~0=~weak$$choice2~0_In1171515774, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1171515774, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1171515774} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1171515774, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1171515774, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1171515774|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1171515774|, ~weak$$choice2~0=~weak$$choice2~0_In1171515774, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1171515774, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1171515774} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 21:24:07,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [602] [602] L813-->L814: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~x$r_buff0_thd0~0_53 v_~x$r_buff0_thd0~0_52)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_6|, ~weak$$choice2~0=v_~weak$$choice2~0_18} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:24:07,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L816-->L819-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$mem_tmp~0_6 v_~x~0_23) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:24:07,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:24:08,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:24:08 BasicIcfg [2019-12-18 21:24:08,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:24:08,012 INFO L168 Benchmark]: Toolchain (without parser) took 12516.67 ms. Allocated memory was 136.3 MB in the beginning and 510.1 MB in the end (delta: 373.8 MB). Free memory was 99.8 MB in the beginning and 195.1 MB in the end (delta: -95.3 MB). Peak memory consumption was 278.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:24:08,012 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:24:08,013 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.45 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 99.3 MB in the beginning and 155.8 MB in the end (delta: -56.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:24:08,014 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.95 ms. Allocated memory is still 201.3 MB. Free memory was 155.8 MB in the beginning and 152.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:24:08,015 INFO L168 Benchmark]: Boogie Preprocessor took 36.34 ms. Allocated memory is still 201.3 MB. Free memory was 152.2 MB in the beginning and 150.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:24:08,015 INFO L168 Benchmark]: RCFGBuilder took 787.56 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 105.9 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:24:08,016 INFO L168 Benchmark]: TraceAbstraction took 10832.39 ms. Allocated memory was 201.3 MB in the beginning and 510.1 MB in the end (delta: 308.8 MB). Free memory was 105.2 MB in the beginning and 195.1 MB in the end (delta: -89.8 MB). Peak memory consumption was 219.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:24:08,020 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.45 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 99.3 MB in the beginning and 155.8 MB in the end (delta: -56.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.95 ms. Allocated memory is still 201.3 MB. Free memory was 155.8 MB in the beginning and 152.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.34 ms. Allocated memory is still 201.3 MB. Free memory was 152.2 MB in the beginning and 150.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 787.56 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 105.9 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10832.39 ms. Allocated memory was 201.3 MB in the beginning and 510.1 MB in the end (delta: 308.8 MB). Free memory was 105.2 MB in the beginning and 195.1 MB in the end (delta: -89.8 MB). Peak memory consumption was 219.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 148 ProgramPointsBefore, 80 ProgramPointsAfterwards, 182 TransitionsBefore, 92 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 25 ChoiceCompositions, 3580 VarBasedMoverChecksPositive, 150 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48474 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1095, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1096, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L766] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.5s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 998 SDtfs, 1166 SDslu, 2067 SDs, 0 SdLazy, 1353 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12754occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 1729 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 422 NumberOfCodeBlocks, 422 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 358 ConstructedInterpolants, 0 QuantifiedInterpolants, 69279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...