/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:07:20,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:07:20,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:07:20,277 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:07:20,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:07:20,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:07:20,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:07:20,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:07:20,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:07:20,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:07:20,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:07:20,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:07:20,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:07:20,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:07:20,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:07:20,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:07:20,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:07:20,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:07:20,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:07:20,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:07:20,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:07:20,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:07:20,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:07:20,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:07:20,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:07:20,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:07:20,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:07:20,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:07:20,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:07:20,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:07:20,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:07:20,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:07:20,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:07:20,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:07:20,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:07:20,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:07:20,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:07:20,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:07:20,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:07:20,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:07:20,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:07:20,341 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:07:20,378 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:07:20,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:07:20,380 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:07:20,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:07:20,380 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:07:20,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:07:20,381 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:07:20,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:07:20,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:07:20,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:07:20,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:07:20,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:07:20,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:07:20,385 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:07:20,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:07:20,385 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:07:20,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:07:20,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:07:20,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:07:20,386 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:07:20,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:07:20,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:07:20,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:07:20,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:07:20,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:07:20,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:07:20,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:07:20,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:07:20,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:07:20,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:07:20,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:07:20,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:07:20,689 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:07:20,689 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:07:20,690 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i [2019-12-27 02:07:20,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d655ec45/265344466c9b49e19321e2b13b5256e2/FLAGd27ca92b7 [2019-12-27 02:07:21,333 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:07:21,334 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i [2019-12-27 02:07:21,356 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d655ec45/265344466c9b49e19321e2b13b5256e2/FLAGd27ca92b7 [2019-12-27 02:07:21,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d655ec45/265344466c9b49e19321e2b13b5256e2 [2019-12-27 02:07:21,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:07:21,608 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:07:21,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:07:21,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:07:21,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:07:21,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:07:21" (1/1) ... [2019-12-27 02:07:21,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:21, skipping insertion in model container [2019-12-27 02:07:21,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:07:21" (1/1) ... [2019-12-27 02:07:21,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:07:21,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:07:22,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:07:22,226 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:07:22,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:07:22,377 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:07:22,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:22 WrapperNode [2019-12-27 02:07:22,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:07:22,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:07:22,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:07:22,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:07:22,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:22" (1/1) ... [2019-12-27 02:07:22,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:22" (1/1) ... [2019-12-27 02:07:22,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:07:22,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:07:22,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:07:22,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:07:22,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:22" (1/1) ... [2019-12-27 02:07:22,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:22" (1/1) ... [2019-12-27 02:07:22,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:22" (1/1) ... [2019-12-27 02:07:22,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:22" (1/1) ... [2019-12-27 02:07:22,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:22" (1/1) ... [2019-12-27 02:07:22,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:22" (1/1) ... [2019-12-27 02:07:22,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:22" (1/1) ... [2019-12-27 02:07:22,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:07:22,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:07:22,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:07:22,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:07:22,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:07:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:07:22,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:07:22,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:07:22,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:07:22,560 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:07:22,560 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:07:22,560 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:07:22,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:07:22,561 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:07:22,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:07:22,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:07:22,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:07:22,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:07:22,566 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:07:23,361 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:07:23,362 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:07:23,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:07:23 BoogieIcfgContainer [2019-12-27 02:07:23,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:07:23,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:07:23,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:07:23,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:07:23,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:07:21" (1/3) ... [2019-12-27 02:07:23,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520f3e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:07:23, skipping insertion in model container [2019-12-27 02:07:23,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:22" (2/3) ... [2019-12-27 02:07:23,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520f3e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:07:23, skipping insertion in model container [2019-12-27 02:07:23,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:07:23" (3/3) ... [2019-12-27 02:07:23,371 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_rmo.opt.i [2019-12-27 02:07:23,380 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:07:23,380 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:07:23,387 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:07:23,388 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:07:23,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,427 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,427 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,436 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,436 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,437 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,437 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,437 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,465 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,466 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,480 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,481 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,484 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,485 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,492 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,499 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,499 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:23,517 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:07:23,539 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:07:23,540 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:07:23,540 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:07:23,540 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:07:23,540 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:07:23,540 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:07:23,540 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:07:23,540 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:07:23,558 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 02:07:23,560 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 02:07:23,672 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 02:07:23,672 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:07:23,689 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:07:23,710 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 02:07:23,772 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 02:07:23,772 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:07:23,779 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:07:23,799 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 02:07:23,800 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:07:29,004 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 02:07:29,124 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 02:07:29,149 INFO L206 etLargeBlockEncoding]: Checked pairs total: 79058 [2019-12-27 02:07:29,149 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 02:07:29,153 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 02:07:47,173 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115078 states. [2019-12-27 02:07:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 115078 states. [2019-12-27 02:07:47,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 02:07:47,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:07:47,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 02:07:47,182 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:07:47,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:07:47,189 INFO L82 PathProgramCache]: Analyzing trace with hash 811621075, now seen corresponding path program 1 times [2019-12-27 02:07:47,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:07:47,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779973486] [2019-12-27 02:07:47,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:07:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:07:47,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:07:47,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779973486] [2019-12-27 02:07:47,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:07:47,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:07:47,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431997759] [2019-12-27 02:07:47,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:07:47,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:07:47,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:07:47,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:07:47,434 INFO L87 Difference]: Start difference. First operand 115078 states. Second operand 3 states. [2019-12-27 02:07:48,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:07:48,445 INFO L93 Difference]: Finished difference Result 114778 states and 493920 transitions. [2019-12-27 02:07:48,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:07:48,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 02:07:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:07:52,083 INFO L225 Difference]: With dead ends: 114778 [2019-12-27 02:07:52,083 INFO L226 Difference]: Without dead ends: 112412 [2019-12-27 02:07:52,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:07:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112412 states. [2019-12-27 02:07:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112412 to 112412. [2019-12-27 02:07:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112412 states. [2019-12-27 02:07:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112412 states to 112412 states and 484274 transitions. [2019-12-27 02:07:59,038 INFO L78 Accepts]: Start accepts. Automaton has 112412 states and 484274 transitions. Word has length 5 [2019-12-27 02:07:59,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:07:59,038 INFO L462 AbstractCegarLoop]: Abstraction has 112412 states and 484274 transitions. [2019-12-27 02:07:59,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:07:59,038 INFO L276 IsEmpty]: Start isEmpty. Operand 112412 states and 484274 transitions. [2019-12-27 02:07:59,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:07:59,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:07:59,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:07:59,042 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:07:59,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:07:59,043 INFO L82 PathProgramCache]: Analyzing trace with hash -287251583, now seen corresponding path program 1 times [2019-12-27 02:07:59,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:07:59,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031096892] [2019-12-27 02:07:59,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:07:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:07:59,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:07:59,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031096892] [2019-12-27 02:07:59,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:07:59,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:07:59,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539566189] [2019-12-27 02:07:59,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:07:59,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:07:59,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:07:59,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:07:59,200 INFO L87 Difference]: Start difference. First operand 112412 states and 484274 transitions. Second operand 4 states. [2019-12-27 02:08:04,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:04,334 INFO L93 Difference]: Finished difference Result 180702 states and 747767 transitions. [2019-12-27 02:08:04,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:08:04,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:08:04,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:05,110 INFO L225 Difference]: With dead ends: 180702 [2019-12-27 02:08:05,110 INFO L226 Difference]: Without dead ends: 180653 [2019-12-27 02:08:05,111 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-27 02:08:10,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180653 states. [2019-12-27 02:08:17,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180653 to 165577. [2019-12-27 02:08:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165577 states. [2019-12-27 02:08:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165577 states to 165577 states and 693075 transitions. [2019-12-27 02:08:18,821 INFO L78 Accepts]: Start accepts. Automaton has 165577 states and 693075 transitions. Word has length 11 [2019-12-27 02:08:18,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:18,821 INFO L462 AbstractCegarLoop]: Abstraction has 165577 states and 693075 transitions. [2019-12-27 02:08:18,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:08:18,821 INFO L276 IsEmpty]: Start isEmpty. Operand 165577 states and 693075 transitions. [2019-12-27 02:08:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:08:18,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:18,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:18,830 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:18,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:18,831 INFO L82 PathProgramCache]: Analyzing trace with hash 228163746, now seen corresponding path program 1 times [2019-12-27 02:08:18,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:18,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199157907] [2019-12-27 02:08:18,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:18,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:08:18,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199157907] [2019-12-27 02:08:18,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:18,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:08:18,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911464157] [2019-12-27 02:08:18,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:08:18,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:18,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:08:18,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:08:18,964 INFO L87 Difference]: Start difference. First operand 165577 states and 693075 transitions. Second operand 4 states. [2019-12-27 02:08:27,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:27,613 INFO L93 Difference]: Finished difference Result 235681 states and 964563 transitions. [2019-12-27 02:08:27,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:08:27,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 02:08:27,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:28,336 INFO L225 Difference]: With dead ends: 235681 [2019-12-27 02:08:28,336 INFO L226 Difference]: Without dead ends: 235618 [2019-12-27 02:08:28,336 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-27 02:08:34,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235618 states. [2019-12-27 02:08:38,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235618 to 199613. [2019-12-27 02:08:38,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199613 states. [2019-12-27 02:08:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199613 states to 199613 states and 830031 transitions. [2019-12-27 02:08:40,053 INFO L78 Accepts]: Start accepts. Automaton has 199613 states and 830031 transitions. Word has length 13 [2019-12-27 02:08:40,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:40,054 INFO L462 AbstractCegarLoop]: Abstraction has 199613 states and 830031 transitions. [2019-12-27 02:08:40,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:08:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 199613 states and 830031 transitions. [2019-12-27 02:08:40,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:08:40,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:40,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:40,058 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:40,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:40,058 INFO L82 PathProgramCache]: Analyzing trace with hash 986322522, now seen corresponding path program 1 times [2019-12-27 02:08:40,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:40,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292860088] [2019-12-27 02:08:40,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:08:40,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292860088] [2019-12-27 02:08:40,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:40,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:08:40,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021372773] [2019-12-27 02:08:40,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:08:40,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:40,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:08:40,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:08:40,108 INFO L87 Difference]: Start difference. First operand 199613 states and 830031 transitions. Second operand 3 states. [2019-12-27 02:08:40,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:40,261 INFO L93 Difference]: Finished difference Result 39466 states and 128760 transitions. [2019-12-27 02:08:40,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:08:40,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:08:40,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:40,324 INFO L225 Difference]: With dead ends: 39466 [2019-12-27 02:08:40,324 INFO L226 Difference]: Without dead ends: 39466 [2019-12-27 02:08:40,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:08:40,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39466 states. [2019-12-27 02:08:40,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39466 to 39466. [2019-12-27 02:08:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39466 states. [2019-12-27 02:08:40,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39466 states to 39466 states and 128760 transitions. [2019-12-27 02:08:40,990 INFO L78 Accepts]: Start accepts. Automaton has 39466 states and 128760 transitions. Word has length 13 [2019-12-27 02:08:40,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:40,991 INFO L462 AbstractCegarLoop]: Abstraction has 39466 states and 128760 transitions. [2019-12-27 02:08:40,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:08:40,991 INFO L276 IsEmpty]: Start isEmpty. Operand 39466 states and 128760 transitions. [2019-12-27 02:08:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 02:08:40,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:40,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:40,996 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:40,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:40,996 INFO L82 PathProgramCache]: Analyzing trace with hash -462367392, now seen corresponding path program 1 times [2019-12-27 02:08:40,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:40,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621944195] [2019-12-27 02:08:40,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:08:41,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621944195] [2019-12-27 02:08:41,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:41,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:08:41,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774802883] [2019-12-27 02:08:41,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:08:41,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:41,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:08:41,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:08:41,083 INFO L87 Difference]: Start difference. First operand 39466 states and 128760 transitions. Second operand 5 states. [2019-12-27 02:08:41,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:41,843 INFO L93 Difference]: Finished difference Result 53323 states and 170492 transitions. [2019-12-27 02:08:41,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:08:41,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 02:08:41,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:41,930 INFO L225 Difference]: With dead ends: 53323 [2019-12-27 02:08:41,930 INFO L226 Difference]: Without dead ends: 53310 [2019-12-27 02:08:41,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:08:42,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53310 states. [2019-12-27 02:08:43,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53310 to 39837. [2019-12-27 02:08:43,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39837 states. [2019-12-27 02:08:43,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39837 states to 39837 states and 129810 transitions. [2019-12-27 02:08:43,260 INFO L78 Accepts]: Start accepts. Automaton has 39837 states and 129810 transitions. Word has length 19 [2019-12-27 02:08:43,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:43,261 INFO L462 AbstractCegarLoop]: Abstraction has 39837 states and 129810 transitions. [2019-12-27 02:08:43,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:08:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand 39837 states and 129810 transitions. [2019-12-27 02:08:43,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:08:43,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:43,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:43,274 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:43,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:43,275 INFO L82 PathProgramCache]: Analyzing trace with hash 781437825, now seen corresponding path program 1 times [2019-12-27 02:08:43,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:43,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859699402] [2019-12-27 02:08:43,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:08:43,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859699402] [2019-12-27 02:08:43,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:43,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:08:43,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982297309] [2019-12-27 02:08:43,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:08:43,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:43,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:08:43,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:08:43,362 INFO L87 Difference]: Start difference. First operand 39837 states and 129810 transitions. Second operand 4 states. [2019-12-27 02:08:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:43,403 INFO L93 Difference]: Finished difference Result 7581 states and 20788 transitions. [2019-12-27 02:08:43,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:08:43,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:08:43,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:43,413 INFO L225 Difference]: With dead ends: 7581 [2019-12-27 02:08:43,414 INFO L226 Difference]: Without dead ends: 7581 [2019-12-27 02:08:43,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:08:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2019-12-27 02:08:43,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 7441. [2019-12-27 02:08:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7441 states. [2019-12-27 02:08:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 20388 transitions. [2019-12-27 02:08:43,514 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 20388 transitions. Word has length 25 [2019-12-27 02:08:43,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:43,515 INFO L462 AbstractCegarLoop]: Abstraction has 7441 states and 20388 transitions. [2019-12-27 02:08:43,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:08:43,515 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 20388 transitions. [2019-12-27 02:08:43,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 02:08:43,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:43,527 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] [2019-12-27 02:08:43,527 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:43,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:43,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1015424040, now seen corresponding path program 1 times [2019-12-27 02:08:43,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:43,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312119521] [2019-12-27 02:08:43,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:08:43,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312119521] [2019-12-27 02:08:43,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:43,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:08:43,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083466608] [2019-12-27 02:08:43,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:08:43,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:43,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:08:43,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:08:43,608 INFO L87 Difference]: Start difference. First operand 7441 states and 20388 transitions. Second operand 5 states. [2019-12-27 02:08:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:43,652 INFO L93 Difference]: Finished difference Result 5402 states and 15528 transitions. [2019-12-27 02:08:43,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:08:43,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 02:08:43,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:43,660 INFO L225 Difference]: With dead ends: 5402 [2019-12-27 02:08:43,661 INFO L226 Difference]: Without dead ends: 5402 [2019-12-27 02:08:43,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:08:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2019-12-27 02:08:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 4989. [2019-12-27 02:08:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-12-27 02:08:43,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 14411 transitions. [2019-12-27 02:08:43,765 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 14411 transitions. Word has length 37 [2019-12-27 02:08:43,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:43,765 INFO L462 AbstractCegarLoop]: Abstraction has 4989 states and 14411 transitions. [2019-12-27 02:08:43,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:08:43,765 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 14411 transitions. [2019-12-27 02:08:43,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:08:43,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:43,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:43,774 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:43,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:43,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1550906862, now seen corresponding path program 1 times [2019-12-27 02:08:43,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:43,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74815929] [2019-12-27 02:08:43,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:08:43,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74815929] [2019-12-27 02:08:43,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:43,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:08:43,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173305225] [2019-12-27 02:08:43,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:08:43,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:43,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:08:43,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:08:43,846 INFO L87 Difference]: Start difference. First operand 4989 states and 14411 transitions. Second operand 3 states. [2019-12-27 02:08:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:43,912 INFO L93 Difference]: Finished difference Result 4998 states and 14420 transitions. [2019-12-27 02:08:43,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:08:43,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:08:43,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:43,920 INFO L225 Difference]: With dead ends: 4998 [2019-12-27 02:08:43,920 INFO L226 Difference]: Without dead ends: 4998 [2019-12-27 02:08:43,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:08:43,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4998 states. [2019-12-27 02:08:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4998 to 4994. [2019-12-27 02:08:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4994 states. [2019-12-27 02:08:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 14416 transitions. [2019-12-27 02:08:43,989 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 14416 transitions. Word has length 65 [2019-12-27 02:08:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:43,990 INFO L462 AbstractCegarLoop]: Abstraction has 4994 states and 14416 transitions. [2019-12-27 02:08:43,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:08:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 14416 transitions. [2019-12-27 02:08:43,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:08:43,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:43,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:43,997 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:43,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:43,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1256158932, now seen corresponding path program 1 times [2019-12-27 02:08:43,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:43,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122523741] [2019-12-27 02:08:43,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:08:44,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122523741] [2019-12-27 02:08:44,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:44,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:08:44,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143805766] [2019-12-27 02:08:44,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:08:44,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:44,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:08:44,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:08:44,110 INFO L87 Difference]: Start difference. First operand 4994 states and 14416 transitions. Second operand 3 states. [2019-12-27 02:08:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:44,149 INFO L93 Difference]: Finished difference Result 4994 states and 14195 transitions. [2019-12-27 02:08:44,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:08:44,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:08:44,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:44,158 INFO L225 Difference]: With dead ends: 4994 [2019-12-27 02:08:44,158 INFO L226 Difference]: Without dead ends: 4994 [2019-12-27 02:08:44,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:08:44,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4994 states. [2019-12-27 02:08:44,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4994 to 4994. [2019-12-27 02:08:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4994 states. [2019-12-27 02:08:44,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 14195 transitions. [2019-12-27 02:08:44,266 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 14195 transitions. Word has length 65 [2019-12-27 02:08:44,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:44,267 INFO L462 AbstractCegarLoop]: Abstraction has 4994 states and 14195 transitions. [2019-12-27 02:08:44,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:08:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 14195 transitions. [2019-12-27 02:08:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:08:44,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:44,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:44,278 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:44,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:44,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1760720695, now seen corresponding path program 1 times [2019-12-27 02:08:44,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:44,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449197169] [2019-12-27 02:08:44,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:08:44,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449197169] [2019-12-27 02:08:44,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:44,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:08:44,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006885052] [2019-12-27 02:08:44,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:08:44,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:44,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:08:44,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:08:44,416 INFO L87 Difference]: Start difference. First operand 4994 states and 14195 transitions. Second operand 5 states. [2019-12-27 02:08:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:44,903 INFO L93 Difference]: Finished difference Result 7330 states and 20675 transitions. [2019-12-27 02:08:44,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:08:44,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 02:08:44,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:44,913 INFO L225 Difference]: With dead ends: 7330 [2019-12-27 02:08:44,914 INFO L226 Difference]: Without dead ends: 7330 [2019-12-27 02:08:44,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:08:44,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7330 states. [2019-12-27 02:08:44,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7330 to 6065. [2019-12-27 02:08:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6065 states. [2019-12-27 02:08:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6065 states to 6065 states and 17257 transitions. [2019-12-27 02:08:45,007 INFO L78 Accepts]: Start accepts. Automaton has 6065 states and 17257 transitions. Word has length 66 [2019-12-27 02:08:45,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:45,007 INFO L462 AbstractCegarLoop]: Abstraction has 6065 states and 17257 transitions. [2019-12-27 02:08:45,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:08:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 6065 states and 17257 transitions. [2019-12-27 02:08:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:08:45,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:45,016 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:45,016 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:45,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:45,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1764113003, now seen corresponding path program 2 times [2019-12-27 02:08:45,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:45,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560021136] [2019-12-27 02:08:45,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:08:45,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560021136] [2019-12-27 02:08:45,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:45,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:08:45,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143189323] [2019-12-27 02:08:45,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:08:45,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:45,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:08:45,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:08:45,124 INFO L87 Difference]: Start difference. First operand 6065 states and 17257 transitions. Second operand 5 states. [2019-12-27 02:08:45,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:45,458 INFO L93 Difference]: Finished difference Result 8773 states and 24705 transitions. [2019-12-27 02:08:45,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:08:45,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 02:08:45,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:45,469 INFO L225 Difference]: With dead ends: 8773 [2019-12-27 02:08:45,469 INFO L226 Difference]: Without dead ends: 8773 [2019-12-27 02:08:45,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:08:45,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8773 states. [2019-12-27 02:08:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8773 to 6413. [2019-12-27 02:08:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6413 states. [2019-12-27 02:08:45,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6413 states to 6413 states and 18290 transitions. [2019-12-27 02:08:45,572 INFO L78 Accepts]: Start accepts. Automaton has 6413 states and 18290 transitions. Word has length 66 [2019-12-27 02:08:45,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:45,572 INFO L462 AbstractCegarLoop]: Abstraction has 6413 states and 18290 transitions. [2019-12-27 02:08:45,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:08:45,572 INFO L276 IsEmpty]: Start isEmpty. Operand 6413 states and 18290 transitions. [2019-12-27 02:08:45,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:08:45,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:45,581 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:45,581 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:45,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:45,581 INFO L82 PathProgramCache]: Analyzing trace with hash 956425645, now seen corresponding path program 3 times [2019-12-27 02:08:45,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:45,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340497692] [2019-12-27 02:08:45,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:08:45,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340497692] [2019-12-27 02:08:45,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:45,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:08:45,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962243686] [2019-12-27 02:08:45,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:08:45,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:45,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:08:45,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:08:45,695 INFO L87 Difference]: Start difference. First operand 6413 states and 18290 transitions. Second operand 6 states. [2019-12-27 02:08:46,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:46,116 INFO L93 Difference]: Finished difference Result 8691 states and 24471 transitions. [2019-12-27 02:08:46,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:08:46,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 02:08:46,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:46,129 INFO L225 Difference]: With dead ends: 8691 [2019-12-27 02:08:46,130 INFO L226 Difference]: Without dead ends: 8691 [2019-12-27 02:08:46,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:08:46,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8691 states. [2019-12-27 02:08:46,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8691 to 6840. [2019-12-27 02:08:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6840 states. [2019-12-27 02:08:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6840 states to 6840 states and 19489 transitions. [2019-12-27 02:08:46,277 INFO L78 Accepts]: Start accepts. Automaton has 6840 states and 19489 transitions. Word has length 66 [2019-12-27 02:08:46,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:46,277 INFO L462 AbstractCegarLoop]: Abstraction has 6840 states and 19489 transitions. [2019-12-27 02:08:46,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:08:46,277 INFO L276 IsEmpty]: Start isEmpty. Operand 6840 states and 19489 transitions. [2019-12-27 02:08:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:08:46,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:46,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:46,287 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:46,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:46,287 INFO L82 PathProgramCache]: Analyzing trace with hash 426723893, now seen corresponding path program 4 times [2019-12-27 02:08:46,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:46,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092236499] [2019-12-27 02:08:46,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:46,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:08:46,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092236499] [2019-12-27 02:08:46,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:46,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:08:46,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921235959] [2019-12-27 02:08:46,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:08:46,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:46,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:08:46,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:08:46,365 INFO L87 Difference]: Start difference. First operand 6840 states and 19489 transitions. Second operand 3 states. [2019-12-27 02:08:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:46,440 INFO L93 Difference]: Finished difference Result 6840 states and 19488 transitions. [2019-12-27 02:08:46,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:08:46,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 02:08:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:46,451 INFO L225 Difference]: With dead ends: 6840 [2019-12-27 02:08:46,451 INFO L226 Difference]: Without dead ends: 6840 [2019-12-27 02:08:46,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:08:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6840 states. [2019-12-27 02:08:46,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6840 to 4178. [2019-12-27 02:08:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4178 states. [2019-12-27 02:08:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 12093 transitions. [2019-12-27 02:08:46,563 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 12093 transitions. Word has length 66 [2019-12-27 02:08:46,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:46,563 INFO L462 AbstractCegarLoop]: Abstraction has 4178 states and 12093 transitions. [2019-12-27 02:08:46,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:08:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 12093 transitions. [2019-12-27 02:08:46,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:08:46,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:46,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:46,572 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:46,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:46,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1488093963, now seen corresponding path program 1 times [2019-12-27 02:08:46,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:46,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105088672] [2019-12-27 02:08:46,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:46,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:08:46,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105088672] [2019-12-27 02:08:46,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:46,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:08:46,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691900839] [2019-12-27 02:08:46,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:08:46,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:46,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:08:46,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:08:46,640 INFO L87 Difference]: Start difference. First operand 4178 states and 12093 transitions. Second operand 3 states. [2019-12-27 02:08:46,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:46,667 INFO L93 Difference]: Finished difference Result 3871 states and 10957 transitions. [2019-12-27 02:08:46,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:08:46,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 02:08:46,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:46,673 INFO L225 Difference]: With dead ends: 3871 [2019-12-27 02:08:46,674 INFO L226 Difference]: Without dead ends: 3871 [2019-12-27 02:08:46,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:08:46,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2019-12-27 02:08:46,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3183. [2019-12-27 02:08:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-12-27 02:08:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 9013 transitions. [2019-12-27 02:08:46,747 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 9013 transitions. Word has length 67 [2019-12-27 02:08:46,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:46,747 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 9013 transitions. [2019-12-27 02:08:46,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:08:46,748 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 9013 transitions. [2019-12-27 02:08:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 02:08:46,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:46,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:46,755 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:46,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:46,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2084050195, now seen corresponding path program 1 times [2019-12-27 02:08:46,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:46,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706914003] [2019-12-27 02:08:46,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:08:47,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706914003] [2019-12-27 02:08:47,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:47,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 02:08:47,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101001616] [2019-12-27 02:08:47,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:08:47,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:47,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:08:47,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:08:47,033 INFO L87 Difference]: Start difference. First operand 3183 states and 9013 transitions. Second operand 12 states. [2019-12-27 02:08:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:48,022 INFO L93 Difference]: Finished difference Result 11237 states and 32497 transitions. [2019-12-27 02:08:48,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 02:08:48,023 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-27 02:08:48,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:48,030 INFO L225 Difference]: With dead ends: 11237 [2019-12-27 02:08:48,031 INFO L226 Difference]: Without dead ends: 4921 [2019-12-27 02:08:48,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2019-12-27 02:08:48,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4921 states. [2019-12-27 02:08:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4921 to 2607. [2019-12-27 02:08:48,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2019-12-27 02:08:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 7312 transitions. [2019-12-27 02:08:48,081 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 7312 transitions. Word has length 68 [2019-12-27 02:08:48,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:48,081 INFO L462 AbstractCegarLoop]: Abstraction has 2607 states and 7312 transitions. [2019-12-27 02:08:48,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:08:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 7312 transitions. [2019-12-27 02:08:48,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 02:08:48,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:48,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:48,084 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:48,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:48,085 INFO L82 PathProgramCache]: Analyzing trace with hash -293308025, now seen corresponding path program 2 times [2019-12-27 02:08:48,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:48,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120213030] [2019-12-27 02:08:48,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:08:48,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120213030] [2019-12-27 02:08:48,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:48,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:08:48,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614060093] [2019-12-27 02:08:48,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:08:48,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:48,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:08:48,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:08:48,205 INFO L87 Difference]: Start difference. First operand 2607 states and 7312 transitions. Second operand 6 states. [2019-12-27 02:08:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:48,302 INFO L93 Difference]: Finished difference Result 4997 states and 14053 transitions. [2019-12-27 02:08:48,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:08:48,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 02:08:48,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:48,371 INFO L225 Difference]: With dead ends: 4997 [2019-12-27 02:08:48,371 INFO L226 Difference]: Without dead ends: 2359 [2019-12-27 02:08:48,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:08:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2019-12-27 02:08:48,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 1963. [2019-12-27 02:08:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-27 02:08:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 5460 transitions. [2019-12-27 02:08:48,421 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 5460 transitions. Word has length 68 [2019-12-27 02:08:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:48,421 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 5460 transitions. [2019-12-27 02:08:48,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:08:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 5460 transitions. [2019-12-27 02:08:48,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 02:08:48,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:48,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:48,425 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:48,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:48,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1266757317, now seen corresponding path program 3 times [2019-12-27 02:08:48,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:48,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009807967] [2019-12-27 02:08:48,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:08:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:08:48,597 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:08:48,598 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:08:48,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t760~0.base_20| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t760~0.base_20|) |v_ULTIMATE.start_main_~#t760~0.offset_17| 0))) (= 0 v_~__unbuffered_p2_EAX~0_23) (= (store .cse0 |v_ULTIMATE.start_main_~#t760~0.base_20| 1) |v_#valid_55|) (= v_~z~0_18 0) (= 0 v_~weak$$choice0~0_14) (= v_~x$flush_delayed~0_41 0) (= 0 v_~x$r_buff0_thd3~0_99) (= v_~x$r_buff1_thd1~0_192 0) (= 0 v_~x$w_buff0~0_203) (= v_~weak$$choice2~0_116 0) (= 0 |v_ULTIMATE.start_main_~#t760~0.offset_17|) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$r_buff1_thd3~0_193) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff1~0_195) (= v_~x$mem_tmp~0_22 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t760~0.base_20|) (= v_~__unbuffered_p2_EBX~0_23 0) (= 0 v_~x$r_buff0_thd2~0_205) (= v_~main$tmp_guard1~0_28 0) (= v_~x$r_buff0_thd0~0_335 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_279 0) (= 0 v_~x$w_buff1_used~0_401) (= v_~__unbuffered_cnt~0_145 0) (= 0 v_~x$r_buff1_thd2~0_186) (= 0 v_~x$w_buff0_used~0_743) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t760~0.base_20| 4) |v_#length_25|) (= |v_#NULL.offset_5| 0) (= 0 v_~x~0_213) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t760~0.base_20|) 0) (= 0 v_~x$r_buff0_thd1~0_88) (= 0 |v_#NULL.base_5|) (= v_~y~0_136 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t760~0.base=|v_ULTIMATE.start_main_~#t760~0.base_20|, ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_203, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ULTIMATE.start_main_~#t761~0.offset=|v_ULTIMATE.start_main_~#t761~0.offset_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_41, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_31|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_192, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_99, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_335, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_23, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ~x$w_buff1~0=v_~x$w_buff1~0_195, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_46|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_401, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_186, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_50|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_156|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_213, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_193, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_33|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_273|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_34|, ULTIMATE.start_main_~#t760~0.offset=|v_ULTIMATE.start_main_~#t760~0.offset_17|, ~y~0=v_~y~0_136, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_279, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_205, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_~#t761~0.base=|v_ULTIMATE.start_main_~#t761~0.base_21|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_743, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_162|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t762~0.base=|v_ULTIMATE.start_main_~#t762~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_55|, ULTIMATE.start_main_~#t762~0.offset=|v_ULTIMATE.start_main_~#t762~0.offset_17|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_18, ~weak$$choice2~0=v_~weak$$choice2~0_116, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t760~0.base, ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t761~0.offset, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~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~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t760~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, 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, ULTIMATE.start_main_~#t761~0.base, #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_~#t762~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t762~0.offset, #memory_int, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 02:08:48,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L810-1-->L812: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t761~0.base_13| 4) |v_#length_17|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t761~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t761~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t761~0.offset_11|) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t761~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t761~0.base_13|) |v_ULTIMATE.start_main_~#t761~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t761~0.base_13|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t761~0.base_13| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t761~0.offset=|v_ULTIMATE.start_main_~#t761~0.offset_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t761~0.base=|v_ULTIMATE.start_main_~#t761~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t761~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t761~0.base] because there is no mapped edge [2019-12-27 02:08:48,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L812-1-->L814: Formula: (and (not (= |v_ULTIMATE.start_main_~#t762~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t762~0.offset_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t762~0.base_13| 4) |v_#length_15|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t762~0.base_13|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t762~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t762~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t762~0.base_13|) |v_ULTIMATE.start_main_~#t762~0.offset_11| 2)) |v_#memory_int_13|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t762~0.base_13| 1) |v_#valid_34|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t762~0.base=|v_ULTIMATE.start_main_~#t762~0.base_13|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t762~0.offset=|v_ULTIMATE.start_main_~#t762~0.offset_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t762~0.base, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t762~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 02:08:48,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_12 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|) (= (mod v_~x$w_buff1_used~0_145 256) 0) (= v_~x$w_buff0~0_44 v_~x$w_buff1~0_51) (= 2 v_~x$w_buff0~0_43) (= 1 v_~x$w_buff0_used~0_300) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|) (= v_~x$w_buff0_used~0_301 v_~x$w_buff1_used~0_145)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_12, ~x$w_buff0~0=v_~x$w_buff0~0_43, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_145, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_300} 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-27 02:08:48,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L787-2-->L787-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-783480363 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-783480363 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-783480363| ~x$w_buff1~0_In-783480363) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out-783480363| ~x~0_In-783480363) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-783480363, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-783480363, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-783480363, ~x~0=~x~0_In-783480363} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-783480363|, ~x$w_buff1~0=~x$w_buff1~0_In-783480363, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-783480363, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-783480363, ~x~0=~x~0_In-783480363} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 02:08:48,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L787-4-->L788: Formula: (= v_~x~0_30 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_9|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 02:08:48,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L735-2-->L735-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out1438172386| |P0Thread1of1ForFork0_#t~ite3_Out1438172386|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1438172386 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1438172386 256) 0))) (or (and .cse0 (= ~x~0_In1438172386 |P0Thread1of1ForFork0_#t~ite3_Out1438172386|) (or .cse1 .cse2)) (and .cse0 (= ~x$w_buff1~0_In1438172386 |P0Thread1of1ForFork0_#t~ite3_Out1438172386|) (not .cse2) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1438172386, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1438172386, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1438172386, ~x~0=~x~0_In1438172386} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1438172386|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1438172386|, ~x$w_buff1~0=~x$w_buff1~0_In1438172386, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1438172386, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1438172386, ~x~0=~x~0_In1438172386} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 02:08:48,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In200899408 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In200899408 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out200899408| ~x$w_buff0_used~0_In200899408)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out200899408| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In200899408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In200899408} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out200899408|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In200899408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In200899408} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 02:08:48,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-890814757 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-890814757 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-890814757| 0)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-890814757| ~x$w_buff0_used~0_In-890814757) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-890814757, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-890814757} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-890814757, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-890814757|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-890814757} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 02:08:48,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-950790747 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-950790747 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-950790747 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-950790747 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-950790747|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite18_Out-950790747| ~x$w_buff1_used~0_In-950790747) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-950790747, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-950790747, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-950790747, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-950790747} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-950790747, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-950790747, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-950790747, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-950790747|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-950790747} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 02:08:48,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L737-->L737-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In221979042 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In221979042 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In221979042 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In221979042 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out221979042|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In221979042 |P0Thread1of1ForFork0_#t~ite6_Out221979042|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In221979042, ~x$w_buff1_used~0=~x$w_buff1_used~0_In221979042, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In221979042, ~x$w_buff0_used~0=~x$w_buff0_used~0_In221979042} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out221979042|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In221979042, ~x$w_buff1_used~0=~x$w_buff1_used~0_In221979042, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In221979042, ~x$w_buff0_used~0=~x$w_buff0_used~0_In221979042} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 02:08:48,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L790-->L790-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In359590778 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In359590778 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out359590778| 0)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out359590778| ~x$r_buff0_thd3~0_In359590778) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In359590778, ~x$w_buff0_used~0=~x$w_buff0_used~0_In359590778} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In359590778, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out359590778|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In359590778} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 02:08:48,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L791-->L791-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1355693617 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1355693617 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1355693617 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1355693617 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite20_Out1355693617| ~x$r_buff1_thd3~0_In1355693617) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite20_Out1355693617| 0)))) InVars {~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1355693617, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1355693617, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1355693617, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1355693617} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1355693617|, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1355693617, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1355693617, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1355693617, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1355693617} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 02:08:48,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L791-2-->P2EXIT: Formula: (and (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork2_#t~ite20_28|) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_27|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 02:08:48,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-2046317360 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2046317360 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-2046317360|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-2046317360| ~x$w_buff0_used~0_In-2046317360)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2046317360, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2046317360} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-2046317360|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2046317360, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2046317360} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 02:08:48,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1659170764 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1659170764 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1659170764 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1659170764 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1659170764| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite12_Out-1659170764| ~x$w_buff1_used~0_In-1659170764) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1659170764, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1659170764, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1659170764, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1659170764} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1659170764, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1659170764, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1659170764|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1659170764, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1659170764} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 02:08:48,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L767-->L768: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1465686552 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1465686552 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out1465686552) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In1465686552 ~x$r_buff0_thd2~0_Out1465686552)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1465686552, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1465686552} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1465686552|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1465686552, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1465686552} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 02:08:48,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In2028157485 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In2028157485 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In2028157485 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In2028157485 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out2028157485| ~x$r_buff1_thd2~0_In2028157485) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite14_Out2028157485| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2028157485, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2028157485, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2028157485, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2028157485} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2028157485, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2028157485, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2028157485, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2028157485|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2028157485} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 02:08:48,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L768-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, 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-27 02:08:48,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L738-->L738-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1670484116 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1670484116 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-1670484116| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-1670484116| ~x$r_buff0_thd1~0_In-1670484116)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1670484116, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1670484116} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1670484116, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1670484116|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1670484116} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 02:08:48,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1408876174 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1408876174 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-1408876174 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1408876174 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1408876174|)) (and (= ~x$r_buff1_thd1~0_In-1408876174 |P0Thread1of1ForFork0_#t~ite8_Out-1408876174|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1408876174, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1408876174, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1408876174, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1408876174} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1408876174, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1408876174|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1408876174, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1408876174, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1408876174} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 02:08:48,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_40 |v_P0Thread1of1ForFork0_#t~ite8_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_19|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_40} 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-27 02:08:48,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L820: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:08:48,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L820-2-->L820-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite24_Out1595537037| |ULTIMATE.start_main_#t~ite25_Out1595537037|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1595537037 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1595537037 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out1595537037| ~x$w_buff1~0_In1595537037) .cse0 (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~x~0_In1595537037 |ULTIMATE.start_main_#t~ite24_Out1595537037|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1595537037, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1595537037, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1595537037, ~x~0=~x~0_In1595537037} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1595537037, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1595537037|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1595537037|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1595537037, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1595537037, ~x~0=~x~0_In1595537037} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 02:08:48,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In41987472 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In41987472 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out41987472| ~x$w_buff0_used~0_In41987472) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite26_Out41987472| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In41987472, ~x$w_buff0_used~0=~x$w_buff0_used~0_In41987472} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In41987472, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out41987472|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In41987472} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 02:08:48,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In2049178260 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2049178260 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In2049178260 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2049178260 256)))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out2049178260| ~x$w_buff1_used~0_In2049178260) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite27_Out2049178260| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2049178260, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2049178260, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2049178260, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2049178260} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2049178260, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2049178260, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out2049178260|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2049178260, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2049178260} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 02:08:48,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In576040039 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In576040039 256)))) (or (and (= ~x$r_buff0_thd0~0_In576040039 |ULTIMATE.start_main_#t~ite28_Out576040039|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out576040039|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In576040039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In576040039} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In576040039, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out576040039|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In576040039} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 02:08:48,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In892819988 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In892819988 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In892819988 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In892819988 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out892819988|)) (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In892819988 |ULTIMATE.start_main_#t~ite29_Out892819988|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In892819988, ~x$w_buff1_used~0=~x$w_buff1_used~0_In892819988, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In892819988, ~x$w_buff0_used~0=~x$w_buff0_used~0_In892819988} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In892819988, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out892819988|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In892819988, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In892819988, ~x$w_buff0_used~0=~x$w_buff0_used~0_In892819988} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 02:08:48,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L836-->L837: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd0~0_87 v_~x$r_buff0_thd0~0_86)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_86, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:08:48,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L839-->L4: Formula: (and (= v_~x$flush_delayed~0_24 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_25 256) 0)) (= v_~x$mem_tmp~0_15 v_~x~0_173)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_173, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:08:48,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 02:08:48,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:08:48 BasicIcfg [2019-12-27 02:08:48,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:08:48,784 INFO L168 Benchmark]: Toolchain (without parser) took 87176.13 ms. Allocated memory was 145.2 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 100.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 02:08:48,784 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 02:08:48,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.69 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.5 MB in the beginning and 156.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:08:48,788 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.70 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:08:48,790 INFO L168 Benchmark]: Boogie Preprocessor took 38.81 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:08:48,791 INFO L168 Benchmark]: RCFGBuilder took 870.52 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 100.6 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:08:48,792 INFO L168 Benchmark]: TraceAbstraction took 85414.72 ms. Allocated memory was 202.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.6 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 02:08:48,802 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.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 768.69 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.5 MB in the beginning and 156.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.70 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.81 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 870.52 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 100.6 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 85414.72 ms. Allocated memory was 202.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.6 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 107 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 5405 VarBasedMoverChecksPositive, 232 VarBasedMoverChecksNegative, 72 SemBasedMoverChecksPositive, 228 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 79058 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t760, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L812] FCALL, FORK 0 pthread_create(&t761, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L814] FCALL, FORK 0 pthread_create(&t762, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=0, z=0] [L754] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L755] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L756] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L757] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L758] 2 x$r_buff0_thd2 = (_Bool)1 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=1] [L787] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=1] [L735] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=1] [L735] 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) [L788] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 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 [L789] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L790] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L764] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=1] [L764] 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) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 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 [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=1] [L820] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L821] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L822] 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 [L823] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L824] 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 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 x$flush_delayed = weak$$choice2 [L830] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=1] [L831] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=1] [L831] 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) [L832] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=1] [L832] 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)) [L833] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=1] [L833] 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)) [L834] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=1] [L834] 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)) [L835] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=1] [L835] 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)) [L837] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=1] [L837] 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)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 85.0s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2430 SDtfs, 1955 SDslu, 4419 SDs, 0 SdLazy, 2513 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 27 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199613occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 76647 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 788 NumberOfCodeBlocks, 788 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 704 ConstructedInterpolants, 0 QuantifiedInterpolants, 114312 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...