/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:22:16,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:22:16,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:22:16,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:22:16,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:22:16,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:22:16,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:22:16,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:22:16,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:22:16,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:22:16,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:22:16,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:22:16,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:22:16,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:22:16,455 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:22:16,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:22:16,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:22:16,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:22:16,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:22:16,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:22:16,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:22:16,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:22:16,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:22:16,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:22:16,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:22:16,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:22:16,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:22:16,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:22:16,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:22:16,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:22:16,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:22:16,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:22:16,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:22:16,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:22:16,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:22:16,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:22:16,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:22:16,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:22:16,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:22:16,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:22:16,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:22:16,490 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:22:16,522 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:22:16,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:22:16,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:22:16,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:22:16,526 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:22:16,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:22:16,527 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:22:16,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:22:16,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:22:16,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:22:16,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:22:16,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:22:16,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:22:16,530 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:22:16,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:22:16,530 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:22:16,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:22:16,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:22:16,531 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:22:16,531 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:22:16,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:22:16,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:22:16,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:22:16,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:22:16,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:22:16,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:22:16,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:22:16,533 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:22:16,533 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:22:16,533 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:22:16,811 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:22:16,828 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:22:16,831 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:22:16,833 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:22:16,834 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:22:16,835 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt.i [2019-12-18 22:22:16,905 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23409d506/6537859d949d4f34812153d3bf2478ee/FLAG5c888c53f [2019-12-18 22:22:17,474 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:22:17,475 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt.i [2019-12-18 22:22:17,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23409d506/6537859d949d4f34812153d3bf2478ee/FLAG5c888c53f [2019-12-18 22:22:17,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23409d506/6537859d949d4f34812153d3bf2478ee [2019-12-18 22:22:17,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:22:17,770 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:22:17,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:22:17,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:22:17,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:22:17,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:22:17" (1/1) ... [2019-12-18 22:22:17,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc0254b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:17, skipping insertion in model container [2019-12-18 22:22:17,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:22:17" (1/1) ... [2019-12-18 22:22:17,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:22:17,859 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:22:18,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:22:18,342 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:22:18,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:22:18,496 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:22:18,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:18 WrapperNode [2019-12-18 22:22:18,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:22:18,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:22:18,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:22:18,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:22:18,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:18" (1/1) ... [2019-12-18 22:22:18,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:18" (1/1) ... [2019-12-18 22:22:18,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:22:18,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:22:18,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:22:18,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:22:18,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:18" (1/1) ... [2019-12-18 22:22:18,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:18" (1/1) ... [2019-12-18 22:22:18,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:18" (1/1) ... [2019-12-18 22:22:18,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:18" (1/1) ... [2019-12-18 22:22:18,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:18" (1/1) ... [2019-12-18 22:22:18,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:18" (1/1) ... [2019-12-18 22:22:18,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:18" (1/1) ... [2019-12-18 22:22:18,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:22:18,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:22:18,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:22:18,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:22:18,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:22:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:22:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:22:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:22:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:22:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:22:18,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:22:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:22:18,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:22:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:22:18,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:22:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:22:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:22:18,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:22:18,697 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:22:19,484 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:22:19,484 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:22:19,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:22:19 BoogieIcfgContainer [2019-12-18 22:22:19,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:22:19,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:22:19,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:22:19,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:22:19,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:22:17" (1/3) ... [2019-12-18 22:22:19,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be1fa24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:22:19, skipping insertion in model container [2019-12-18 22:22:19,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:18" (2/3) ... [2019-12-18 22:22:19,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be1fa24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:22:19, skipping insertion in model container [2019-12-18 22:22:19,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:22:19" (3/3) ... [2019-12-18 22:22:19,495 INFO L109 eAbstractionObserver]: Analyzing ICFG safe004_power.opt.i [2019-12-18 22:22:19,506 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:22:19,507 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:22:19,515 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:22:19,516 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:22:19,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,556 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,557 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,565 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,566 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,566 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,566 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,567 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,594 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,594 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,605 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,606 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,608 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,609 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,609 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,614 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,614 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:22:19,630 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:22:19,651 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:22:19,652 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:22:19,652 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:22:19,652 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:22:19,652 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:22:19,652 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:22:19,652 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:22:19,652 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:22:19,670 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 22:22:19,672 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 22:22:19,770 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 22:22:19,771 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:22:19,797 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:22:19,825 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 22:22:19,898 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 22:22:19,898 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:22:19,910 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:22:19,932 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 22:22:19,933 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:22:23,340 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 22:22:23,473 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 22:22:23,497 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82010 [2019-12-18 22:22:23,498 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-18 22:22:23,501 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 109 transitions [2019-12-18 22:22:42,945 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 117808 states. [2019-12-18 22:22:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 117808 states. [2019-12-18 22:22:42,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:22:42,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:22:42,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:22:42,955 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-18 22:22:42,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:22:42,960 INFO L82 PathProgramCache]: Analyzing trace with hash 806008766, now seen corresponding path program 1 times [2019-12-18 22:22:42,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:22:42,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192472390] [2019-12-18 22:22:42,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:22:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:22:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:22:43,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192472390] [2019-12-18 22:22:43,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:22:43,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:22:43,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610880939] [2019-12-18 22:22:43,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:22:43,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:22:43,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:22:43,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:22:43,300 INFO L87 Difference]: Start difference. First operand 117808 states. Second operand 3 states. [2019-12-18 22:22:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:22:45,963 INFO L93 Difference]: Finished difference Result 117244 states and 506404 transitions. [2019-12-18 22:22:45,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:22:45,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:22:45,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:22:46,922 INFO L225 Difference]: With dead ends: 117244 [2019-12-18 22:22:46,925 INFO L226 Difference]: Without dead ends: 114878 [2019-12-18 22:22:46,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:22:52,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114878 states. [2019-12-18 22:22:55,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114878 to 114878. [2019-12-18 22:22:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114878 states. [2019-12-18 22:22:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114878 states to 114878 states and 496758 transitions. [2019-12-18 22:22:56,029 INFO L78 Accepts]: Start accepts. Automaton has 114878 states and 496758 transitions. Word has length 5 [2019-12-18 22:22:56,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:22:56,030 INFO L462 AbstractCegarLoop]: Abstraction has 114878 states and 496758 transitions. [2019-12-18 22:22:56,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:22:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 114878 states and 496758 transitions. [2019-12-18 22:22:56,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:22:56,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:22:56,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:22:56,034 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-18 22:22:56,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:22:56,034 INFO L82 PathProgramCache]: Analyzing trace with hash 702926397, now seen corresponding path program 1 times [2019-12-18 22:22:56,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:22:56,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517722009] [2019-12-18 22:22:56,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:22:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:22:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:22:56,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517722009] [2019-12-18 22:22:56,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:22:56,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:22:56,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227118380] [2019-12-18 22:22:56,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:22:56,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:22:56,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:22:56,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:22:56,167 INFO L87 Difference]: Start difference. First operand 114878 states and 496758 transitions. Second operand 4 states. [2019-12-18 22:23:01,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:01,552 INFO L93 Difference]: Finished difference Result 184188 states and 760222 transitions. [2019-12-18 22:23:01,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:23:01,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:23:01,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:02,227 INFO L225 Difference]: With dead ends: 184188 [2019-12-18 22:23:02,228 INFO L226 Difference]: Without dead ends: 184139 [2019-12-18 22:23:02,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:23:07,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184139 states. [2019-12-18 22:23:15,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184139 to 169203. [2019-12-18 22:23:15,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169203 states. [2019-12-18 22:23:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169203 states to 169203 states and 707190 transitions. [2019-12-18 22:23:17,441 INFO L78 Accepts]: Start accepts. Automaton has 169203 states and 707190 transitions. Word has length 11 [2019-12-18 22:23:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:17,441 INFO L462 AbstractCegarLoop]: Abstraction has 169203 states and 707190 transitions. [2019-12-18 22:23:17,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:23:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 169203 states and 707190 transitions. [2019-12-18 22:23:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:23:17,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:17,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:23:17,450 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-18 22:23:17,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:17,450 INFO L82 PathProgramCache]: Analyzing trace with hash 702866747, now seen corresponding path program 1 times [2019-12-18 22:23:17,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:17,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101355124] [2019-12-18 22:23:17,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:23:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:23:17,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101355124] [2019-12-18 22:23:17,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:23:17,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:23:17,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942163321] [2019-12-18 22:23:17,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:23:17,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:23:17,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:23:17,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:23:17,541 INFO L87 Difference]: Start difference. First operand 169203 states and 707190 transitions. Second operand 4 states. [2019-12-18 22:23:19,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:19,057 INFO L93 Difference]: Finished difference Result 240014 states and 977713 transitions. [2019-12-18 22:23:19,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:23:19,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:23:19,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:27,214 INFO L225 Difference]: With dead ends: 240014 [2019-12-18 22:23:27,214 INFO L226 Difference]: Without dead ends: 239951 [2019-12-18 22:23:27,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:23:32,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239951 states. [2019-12-18 22:23:35,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239951 to 203645. [2019-12-18 22:23:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203645 states. [2019-12-18 22:23:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203645 states to 203645 states and 844323 transitions. [2019-12-18 22:23:37,527 INFO L78 Accepts]: Start accepts. Automaton has 203645 states and 844323 transitions. Word has length 13 [2019-12-18 22:23:37,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:37,528 INFO L462 AbstractCegarLoop]: Abstraction has 203645 states and 844323 transitions. [2019-12-18 22:23:37,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:23:37,528 INFO L276 IsEmpty]: Start isEmpty. Operand 203645 states and 844323 transitions. [2019-12-18 22:23:37,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:23:37,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:37,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:23:37,531 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-18 22:23:37,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:37,531 INFO L82 PathProgramCache]: Analyzing trace with hash 464803757, now seen corresponding path program 1 times [2019-12-18 22:23:37,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:37,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238639617] [2019-12-18 22:23:37,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:23:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:23:37,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238639617] [2019-12-18 22:23:37,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:23:37,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:23:37,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778612396] [2019-12-18 22:23:37,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:23:37,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:23:37,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:23:37,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:23:37,586 INFO L87 Difference]: Start difference. First operand 203645 states and 844323 transitions. Second operand 3 states. [2019-12-18 22:23:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:37,725 INFO L93 Difference]: Finished difference Result 39928 states and 130360 transitions. [2019-12-18 22:23:37,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:23:37,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:23:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:37,790 INFO L225 Difference]: With dead ends: 39928 [2019-12-18 22:23:37,790 INFO L226 Difference]: Without dead ends: 39928 [2019-12-18 22:23:37,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:23:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39928 states. [2019-12-18 22:23:38,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39928 to 39928. [2019-12-18 22:23:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39928 states. [2019-12-18 22:23:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39928 states to 39928 states and 130360 transitions. [2019-12-18 22:23:38,456 INFO L78 Accepts]: Start accepts. Automaton has 39928 states and 130360 transitions. Word has length 13 [2019-12-18 22:23:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:38,456 INFO L462 AbstractCegarLoop]: Abstraction has 39928 states and 130360 transitions. [2019-12-18 22:23:38,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:23:38,457 INFO L276 IsEmpty]: Start isEmpty. Operand 39928 states and 130360 transitions. [2019-12-18 22:23:38,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:23:38,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:38,460 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-18 22:23:38,460 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-18 22:23:38,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:38,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2009264966, now seen corresponding path program 1 times [2019-12-18 22:23:38,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:38,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432067104] [2019-12-18 22:23:38,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:23:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:23:38,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432067104] [2019-12-18 22:23:38,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:23:38,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:23:38,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219767228] [2019-12-18 22:23:38,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:23:38,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:23:38,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:23:38,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:23:38,548 INFO L87 Difference]: Start difference. First operand 39928 states and 130360 transitions. Second operand 5 states. [2019-12-18 22:23:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:39,387 INFO L93 Difference]: Finished difference Result 53752 states and 171521 transitions. [2019-12-18 22:23:39,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:23:39,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 22:23:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:39,476 INFO L225 Difference]: With dead ends: 53752 [2019-12-18 22:23:39,476 INFO L226 Difference]: Without dead ends: 53739 [2019-12-18 22:23:39,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:23:40,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53739 states. [2019-12-18 22:23:40,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53739 to 40157. [2019-12-18 22:23:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40157 states. [2019-12-18 22:23:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40157 states to 40157 states and 130977 transitions. [2019-12-18 22:23:40,793 INFO L78 Accepts]: Start accepts. Automaton has 40157 states and 130977 transitions. Word has length 19 [2019-12-18 22:23:40,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:40,794 INFO L462 AbstractCegarLoop]: Abstraction has 40157 states and 130977 transitions. [2019-12-18 22:23:40,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:23:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 40157 states and 130977 transitions. [2019-12-18 22:23:40,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:23:40,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:40,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:23:40,805 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-18 22:23:40,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:40,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1059595659, now seen corresponding path program 1 times [2019-12-18 22:23:40,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:40,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129368445] [2019-12-18 22:23:40,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:23:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:23:40,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129368445] [2019-12-18 22:23:40,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:23:40,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:23:40,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746455598] [2019-12-18 22:23:40,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:23:40,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:23:40,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:23:40,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:23:40,876 INFO L87 Difference]: Start difference. First operand 40157 states and 130977 transitions. Second operand 4 states. [2019-12-18 22:23:40,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:40,916 INFO L93 Difference]: Finished difference Result 7224 states and 19739 transitions. [2019-12-18 22:23:40,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:23:40,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:23:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:40,936 INFO L225 Difference]: With dead ends: 7224 [2019-12-18 22:23:40,936 INFO L226 Difference]: Without dead ends: 7224 [2019-12-18 22:23:40,936 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-18 22:23:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2019-12-18 22:23:41,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7112. [2019-12-18 22:23:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7112 states. [2019-12-18 22:23:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7112 states to 7112 states and 19419 transitions. [2019-12-18 22:23:41,055 INFO L78 Accepts]: Start accepts. Automaton has 7112 states and 19419 transitions. Word has length 25 [2019-12-18 22:23:41,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:41,056 INFO L462 AbstractCegarLoop]: Abstraction has 7112 states and 19419 transitions. [2019-12-18 22:23:41,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:23:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 7112 states and 19419 transitions. [2019-12-18 22:23:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 22:23:41,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:41,066 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-18 22:23:41,066 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-18 22:23:41,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:41,067 INFO L82 PathProgramCache]: Analyzing trace with hash -81356198, now seen corresponding path program 1 times [2019-12-18 22:23:41,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:41,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785893651] [2019-12-18 22:23:41,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:23:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:23:41,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785893651] [2019-12-18 22:23:41,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:23:41,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:23:41,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845113393] [2019-12-18 22:23:41,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:23:41,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:23:41,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:23:41,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:23:41,152 INFO L87 Difference]: Start difference. First operand 7112 states and 19419 transitions. Second operand 5 states. [2019-12-18 22:23:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:41,188 INFO L93 Difference]: Finished difference Result 5025 states and 14423 transitions. [2019-12-18 22:23:41,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:23:41,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 22:23:41,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:41,195 INFO L225 Difference]: With dead ends: 5025 [2019-12-18 22:23:41,195 INFO L226 Difference]: Without dead ends: 5025 [2019-12-18 22:23:41,195 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-18 22:23:41,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2019-12-18 22:23:41,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4661. [2019-12-18 22:23:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-12-18 22:23:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 13439 transitions. [2019-12-18 22:23:41,264 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 13439 transitions. Word has length 37 [2019-12-18 22:23:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:41,265 INFO L462 AbstractCegarLoop]: Abstraction has 4661 states and 13439 transitions. [2019-12-18 22:23:41,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:23:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 13439 transitions. [2019-12-18 22:23:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:23:41,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:41,273 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-18 22:23:41,273 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-18 22:23:41,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:41,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2136434843, now seen corresponding path program 1 times [2019-12-18 22:23:41,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:41,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308517366] [2019-12-18 22:23:41,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:23:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:23:41,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308517366] [2019-12-18 22:23:41,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:23:41,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:23:41,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848941081] [2019-12-18 22:23:41,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:23:41,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:23:41,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:23:41,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:23:41,349 INFO L87 Difference]: Start difference. First operand 4661 states and 13439 transitions. Second operand 3 states. [2019-12-18 22:23:41,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:41,413 INFO L93 Difference]: Finished difference Result 4670 states and 13453 transitions. [2019-12-18 22:23:41,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:23:41,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:23:41,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:41,421 INFO L225 Difference]: With dead ends: 4670 [2019-12-18 22:23:41,422 INFO L226 Difference]: Without dead ends: 4670 [2019-12-18 22:23:41,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:23:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-18 22:23:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-18 22:23:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-18 22:23:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13449 transitions. [2019-12-18 22:23:41,485 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13449 transitions. Word has length 65 [2019-12-18 22:23:41,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:41,485 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13449 transitions. [2019-12-18 22:23:41,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:23:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13449 transitions. [2019-12-18 22:23:41,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:23:41,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:41,492 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-18 22:23:41,492 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-18 22:23:41,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:41,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1287100776, now seen corresponding path program 1 times [2019-12-18 22:23:41,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:41,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262159299] [2019-12-18 22:23:41,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:23:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:23:41,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262159299] [2019-12-18 22:23:41,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:23:41,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:23:41,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973898812] [2019-12-18 22:23:41,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:23:41,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:23:41,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:23:41,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:23:41,570 INFO L87 Difference]: Start difference. First operand 4666 states and 13449 transitions. Second operand 3 states. [2019-12-18 22:23:41,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:41,624 INFO L93 Difference]: Finished difference Result 4670 states and 13443 transitions. [2019-12-18 22:23:41,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:23:41,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:23:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:41,630 INFO L225 Difference]: With dead ends: 4670 [2019-12-18 22:23:41,631 INFO L226 Difference]: Without dead ends: 4670 [2019-12-18 22:23:41,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:23:41,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-18 22:23:41,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-18 22:23:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-18 22:23:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13439 transitions. [2019-12-18 22:23:41,693 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13439 transitions. Word has length 65 [2019-12-18 22:23:41,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:41,693 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13439 transitions. [2019-12-18 22:23:41,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:23:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13439 transitions. [2019-12-18 22:23:41,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:23:41,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:41,700 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-18 22:23:41,700 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-18 22:23:41,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:41,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1294757063, now seen corresponding path program 1 times [2019-12-18 22:23:41,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:41,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167093274] [2019-12-18 22:23:41,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:23:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:23:41,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167093274] [2019-12-18 22:23:41,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:23:41,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:23:41,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947524326] [2019-12-18 22:23:41,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:23:41,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:23:41,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:23:41,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:23:41,816 INFO L87 Difference]: Start difference. First operand 4666 states and 13439 transitions. Second operand 6 states. [2019-12-18 22:23:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:42,377 INFO L93 Difference]: Finished difference Result 8767 states and 25089 transitions. [2019-12-18 22:23:42,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:23:42,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 22:23:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:42,389 INFO L225 Difference]: With dead ends: 8767 [2019-12-18 22:23:42,389 INFO L226 Difference]: Without dead ends: 8767 [2019-12-18 22:23:42,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:23:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8767 states. [2019-12-18 22:23:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8767 to 5422. [2019-12-18 22:23:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5422 states. [2019-12-18 22:23:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5422 states to 5422 states and 15669 transitions. [2019-12-18 22:23:42,486 INFO L78 Accepts]: Start accepts. Automaton has 5422 states and 15669 transitions. Word has length 65 [2019-12-18 22:23:42,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:42,487 INFO L462 AbstractCegarLoop]: Abstraction has 5422 states and 15669 transitions. [2019-12-18 22:23:42,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:23:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 5422 states and 15669 transitions. [2019-12-18 22:23:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:23:42,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:42,494 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-18 22:23:42,494 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-18 22:23:42,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:42,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2057570235, now seen corresponding path program 2 times [2019-12-18 22:23:42,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:42,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804200337] [2019-12-18 22:23:42,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:23:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:23:42,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804200337] [2019-12-18 22:23:42,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:23:42,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:23:42,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847574853] [2019-12-18 22:23:42,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:23:42,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:23:42,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:23:42,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:23:42,587 INFO L87 Difference]: Start difference. First operand 5422 states and 15669 transitions. Second operand 5 states. [2019-12-18 22:23:43,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:43,195 INFO L93 Difference]: Finished difference Result 7982 states and 22732 transitions. [2019-12-18 22:23:43,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:23:43,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 22:23:43,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:43,206 INFO L225 Difference]: With dead ends: 7982 [2019-12-18 22:23:43,206 INFO L226 Difference]: Without dead ends: 7982 [2019-12-18 22:23:43,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:23:43,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7982 states. [2019-12-18 22:23:43,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7982 to 5924. [2019-12-18 22:23:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5924 states. [2019-12-18 22:23:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5924 states to 5924 states and 17161 transitions. [2019-12-18 22:23:43,337 INFO L78 Accepts]: Start accepts. Automaton has 5924 states and 17161 transitions. Word has length 65 [2019-12-18 22:23:43,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:43,337 INFO L462 AbstractCegarLoop]: Abstraction has 5924 states and 17161 transitions. [2019-12-18 22:23:43,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:23:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 5924 states and 17161 transitions. [2019-12-18 22:23:43,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:23:43,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:43,347 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-18 22:23:43,347 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-18 22:23:43,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:43,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1243942585, now seen corresponding path program 3 times [2019-12-18 22:23:43,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:43,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285126583] [2019-12-18 22:23:43,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:23:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:23:43,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285126583] [2019-12-18 22:23:43,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:23:43,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:23:43,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440830211] [2019-12-18 22:23:43,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:23:43,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:23:43,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:23:43,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:23:43,418 INFO L87 Difference]: Start difference. First operand 5924 states and 17161 transitions. Second operand 3 states. [2019-12-18 22:23:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:43,451 INFO L93 Difference]: Finished difference Result 5090 states and 14466 transitions. [2019-12-18 22:23:43,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:23:43,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:23:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:43,459 INFO L225 Difference]: With dead ends: 5090 [2019-12-18 22:23:43,459 INFO L226 Difference]: Without dead ends: 5090 [2019-12-18 22:23:43,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:23:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5090 states. [2019-12-18 22:23:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5090 to 4950. [2019-12-18 22:23:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-18 22:23:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14080 transitions. [2019-12-18 22:23:43,557 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14080 transitions. Word has length 65 [2019-12-18 22:23:43,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:43,557 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14080 transitions. [2019-12-18 22:23:43,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:23:43,558 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14080 transitions. [2019-12-18 22:23:43,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:23:43,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:43,567 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-18 22:23:43,567 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-18 22:23:43,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:43,568 INFO L82 PathProgramCache]: Analyzing trace with hash -930835965, now seen corresponding path program 1 times [2019-12-18 22:23:43,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:43,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391281077] [2019-12-18 22:23:43,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:23:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:23:43,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391281077] [2019-12-18 22:23:43,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:23:43,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:23:43,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738883814] [2019-12-18 22:23:43,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:23:43,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:23:43,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:23:43,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:23:43,836 INFO L87 Difference]: Start difference. First operand 4950 states and 14080 transitions. Second operand 7 states. [2019-12-18 22:23:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:44,121 INFO L93 Difference]: Finished difference Result 17012 states and 48683 transitions. [2019-12-18 22:23:44,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:23:44,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 22:23:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:44,137 INFO L225 Difference]: With dead ends: 17012 [2019-12-18 22:23:44,138 INFO L226 Difference]: Without dead ends: 10215 [2019-12-18 22:23:44,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:23:44,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10215 states. [2019-12-18 22:23:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10215 to 4950. [2019-12-18 22:23:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-18 22:23:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14015 transitions. [2019-12-18 22:23:44,286 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14015 transitions. Word has length 66 [2019-12-18 22:23:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:44,286 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14015 transitions. [2019-12-18 22:23:44,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:23:44,286 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14015 transitions. [2019-12-18 22:23:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:23:44,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:44,296 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-18 22:23:44,296 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-18 22:23:44,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:44,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1676100569, now seen corresponding path program 2 times [2019-12-18 22:23:44,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:44,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203316204] [2019-12-18 22:23:44,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:23:44,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:23:44,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203316204] [2019-12-18 22:23:44,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:23:44,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:23:44,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278340516] [2019-12-18 22:23:44,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:23:44,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:23:44,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:23:44,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:23:44,414 INFO L87 Difference]: Start difference. First operand 4950 states and 14015 transitions. Second operand 6 states. [2019-12-18 22:23:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:44,525 INFO L93 Difference]: Finished difference Result 8685 states and 24629 transitions. [2019-12-18 22:23:44,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:23:44,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 22:23:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:44,532 INFO L225 Difference]: With dead ends: 8685 [2019-12-18 22:23:44,533 INFO L226 Difference]: Without dead ends: 3982 [2019-12-18 22:23:44,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:23:44,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3982 states. [2019-12-18 22:23:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3982 to 3292. [2019-12-18 22:23:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3292 states. [2019-12-18 22:23:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 9258 transitions. [2019-12-18 22:23:44,624 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 9258 transitions. Word has length 66 [2019-12-18 22:23:44,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:44,624 INFO L462 AbstractCegarLoop]: Abstraction has 3292 states and 9258 transitions. [2019-12-18 22:23:44,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:23:44,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 9258 transitions. [2019-12-18 22:23:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:23:44,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:44,633 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-18 22:23:44,633 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-18 22:23:44,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:44,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1577722343, now seen corresponding path program 3 times [2019-12-18 22:23:44,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:44,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16927210] [2019-12-18 22:23:44,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:23:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:23:44,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16927210] [2019-12-18 22:23:44,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:23:44,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:23:44,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688135679] [2019-12-18 22:23:44,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:23:44,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:23:44,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:23:44,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:23:44,725 INFO L87 Difference]: Start difference. First operand 3292 states and 9258 transitions. Second operand 5 states. [2019-12-18 22:23:45,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:45,019 INFO L93 Difference]: Finished difference Result 5305 states and 14820 transitions. [2019-12-18 22:23:45,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:23:45,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 22:23:45,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:45,027 INFO L225 Difference]: With dead ends: 5305 [2019-12-18 22:23:45,027 INFO L226 Difference]: Without dead ends: 5305 [2019-12-18 22:23:45,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:23:45,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5305 states. [2019-12-18 22:23:45,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5305 to 4060. [2019-12-18 22:23:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-12-18 22:23:45,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 11459 transitions. [2019-12-18 22:23:45,094 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 11459 transitions. Word has length 66 [2019-12-18 22:23:45,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:45,094 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 11459 transitions. [2019-12-18 22:23:45,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:23:45,094 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 11459 transitions. [2019-12-18 22:23:45,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:23:45,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:45,100 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-18 22:23:45,100 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-18 22:23:45,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:45,100 INFO L82 PathProgramCache]: Analyzing trace with hash -41780101, now seen corresponding path program 4 times [2019-12-18 22:23:45,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:45,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313479067] [2019-12-18 22:23:45,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:23:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:23:45,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313479067] [2019-12-18 22:23:45,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:23:45,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:23:45,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178321168] [2019-12-18 22:23:45,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:23:45,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:23:45,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:23:45,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:23:45,230 INFO L87 Difference]: Start difference. First operand 4060 states and 11459 transitions. Second operand 7 states. [2019-12-18 22:23:45,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:45,344 INFO L93 Difference]: Finished difference Result 8124 states and 23139 transitions. [2019-12-18 22:23:45,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:23:45,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 22:23:45,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:45,351 INFO L225 Difference]: With dead ends: 8124 [2019-12-18 22:23:45,351 INFO L226 Difference]: Without dead ends: 4135 [2019-12-18 22:23:45,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:23:45,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4135 states. [2019-12-18 22:23:45,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4135 to 3444. [2019-12-18 22:23:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3444 states. [2019-12-18 22:23:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 3444 states and 9768 transitions. [2019-12-18 22:23:45,430 INFO L78 Accepts]: Start accepts. Automaton has 3444 states and 9768 transitions. Word has length 66 [2019-12-18 22:23:45,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:45,430 INFO L462 AbstractCegarLoop]: Abstraction has 3444 states and 9768 transitions. [2019-12-18 22:23:45,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:23:45,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3444 states and 9768 transitions. [2019-12-18 22:23:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:23:45,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:45,438 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-18 22:23:45,438 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-18 22:23:45,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:45,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1242256403, now seen corresponding path program 5 times [2019-12-18 22:23:45,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:45,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671408328] [2019-12-18 22:23:45,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:23:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:23:45,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671408328] [2019-12-18 22:23:45,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:23:45,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:23:45,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255025806] [2019-12-18 22:23:45,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:23:45,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:23:45,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:23:45,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:23:45,501 INFO L87 Difference]: Start difference. First operand 3444 states and 9768 transitions. Second operand 3 states. [2019-12-18 22:23:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:45,519 INFO L93 Difference]: Finished difference Result 2673 states and 7355 transitions. [2019-12-18 22:23:45,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:23:45,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 22:23:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:45,524 INFO L225 Difference]: With dead ends: 2673 [2019-12-18 22:23:45,524 INFO L226 Difference]: Without dead ends: 2673 [2019-12-18 22:23:45,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:23:45,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2019-12-18 22:23:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2577. [2019-12-18 22:23:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2577 states. [2019-12-18 22:23:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2577 states to 2577 states and 7107 transitions. [2019-12-18 22:23:45,579 INFO L78 Accepts]: Start accepts. Automaton has 2577 states and 7107 transitions. Word has length 66 [2019-12-18 22:23:45,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:45,579 INFO L462 AbstractCegarLoop]: Abstraction has 2577 states and 7107 transitions. [2019-12-18 22:23:45,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:23:45,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2577 states and 7107 transitions. [2019-12-18 22:23:45,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:23:45,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:45,589 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-18 22:23:45,589 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:23:45,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:45,590 INFO L82 PathProgramCache]: Analyzing trace with hash -718189845, now seen corresponding path program 1 times [2019-12-18 22:23:45,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:45,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126422186] [2019-12-18 22:23:45,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:23:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:23:46,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126422186] [2019-12-18 22:23:46,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:23:46,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:23:46,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689531201] [2019-12-18 22:23:46,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 22:23:46,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:23:46,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 22:23:46,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:23:46,046 INFO L87 Difference]: Start difference. First operand 2577 states and 7107 transitions. Second operand 13 states. [2019-12-18 22:23:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:48,496 INFO L93 Difference]: Finished difference Result 4751 states and 12754 transitions. [2019-12-18 22:23:48,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 22:23:48,496 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-18 22:23:48,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:48,502 INFO L225 Difference]: With dead ends: 4751 [2019-12-18 22:23:48,502 INFO L226 Difference]: Without dead ends: 4751 [2019-12-18 22:23:48,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 22:23:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4751 states. [2019-12-18 22:23:48,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4751 to 2544. [2019-12-18 22:23:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2544 states. [2019-12-18 22:23:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 6922 transitions. [2019-12-18 22:23:48,568 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 6922 transitions. Word has length 67 [2019-12-18 22:23:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:48,569 INFO L462 AbstractCegarLoop]: Abstraction has 2544 states and 6922 transitions. [2019-12-18 22:23:48,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 22:23:48,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 6922 transitions. [2019-12-18 22:23:48,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:23:48,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:48,573 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-18 22:23:48,573 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:23:48,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:48,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1533693959, now seen corresponding path program 2 times [2019-12-18 22:23:48,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:48,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861127503] [2019-12-18 22:23:48,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:23:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:23:48,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861127503] [2019-12-18 22:23:48,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:23:48,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:23:48,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175034254] [2019-12-18 22:23:48,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:23:48,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:23:48,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:23:48,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:23:48,664 INFO L87 Difference]: Start difference. First operand 2544 states and 6922 transitions. Second operand 3 states. [2019-12-18 22:23:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:23:48,716 INFO L93 Difference]: Finished difference Result 2544 states and 6921 transitions. [2019-12-18 22:23:48,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:23:48,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 22:23:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:23:48,720 INFO L225 Difference]: With dead ends: 2544 [2019-12-18 22:23:48,720 INFO L226 Difference]: Without dead ends: 2544 [2019-12-18 22:23:48,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:23:48,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2019-12-18 22:23:48,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 1752. [2019-12-18 22:23:48,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2019-12-18 22:23:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 4799 transitions. [2019-12-18 22:23:48,752 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 4799 transitions. Word has length 67 [2019-12-18 22:23:48,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:23:48,752 INFO L462 AbstractCegarLoop]: Abstraction has 1752 states and 4799 transitions. [2019-12-18 22:23:48,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:23:48,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 4799 transitions. [2019-12-18 22:23:48,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:23:48,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:23:48,754 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-18 22:23:48,755 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:23:48,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:23:48,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1952420056, now seen corresponding path program 1 times [2019-12-18 22:23:48,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:23:48,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455330871] [2019-12-18 22:23:48,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:23:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:23:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:23:48,863 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:23:48,863 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:23:48,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_19 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~x$w_buff0_used~0_117) (= v_~x$w_buff1_used~0_74 0) (= 0 v_~x$r_buff0_thd2~0_26) (= v_~x~0_30 0) (= 0 v_~x$r_buff0_thd1~0_20) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1876~0.base_20|)) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1876~0.base_20| 4) |v_#length_25|) (= |v_ULTIMATE.start_main_~#t1876~0.offset_17| 0) (= v_~x$flush_delayed~0_16 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1876~0.base_20|) (= v_~x$r_buff1_thd0~0_47 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$r_buff0_thd0~0_79) (= 0 |v_#NULL.base_4|) (= 0 v_~x$w_buff1~0_29) (= 0 v_~__unbuffered_cnt~0_19) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1876~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1876~0.base_20|) |v_ULTIMATE.start_main_~#t1876~0.offset_17| 0)) |v_#memory_int_21|) (= v_~y~0_13 0) (= v_~x$r_buff1_thd2~0_19 0) (= v_~__unbuffered_p2_EBX~0_8 0) (= |v_#NULL.offset_4| 0) (= v_~x$mem_tmp~0_11 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1876~0.base_20| 1)) (= 0 v_~x$w_buff0~0_30) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~weak$$choice2~0_31))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ~x$w_buff0~0=v_~x$w_buff0~0_30, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ULTIMATE.start_main_~#t1878~0.offset=|v_ULTIMATE.start_main_~#t1878~0.offset_16|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_79, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~x$w_buff1~0=v_~x$w_buff1~0_29, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1876~0.offset=|v_ULTIMATE.start_main_~#t1876~0.offset_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_30, ULTIMATE.start_main_~#t1877~0.offset=|v_ULTIMATE.start_main_~#t1877~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~y~0=v_~y~0_13, ULTIMATE.start_main_~#t1876~0.base=|v_ULTIMATE.start_main_~#t1876~0.base_20|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_47, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, ULTIMATE.start_main_~#t1878~0.base=|v_ULTIMATE.start_main_~#t1878~0.base_20|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ULTIMATE.start_main_~#t1877~0.base=|v_ULTIMATE.start_main_~#t1877~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~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, ULTIMATE.start_main_~#t1878~0.offset, #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_~#t1876~0.offset, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1877~0.offset, ~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, ~y~0, ULTIMATE.start_main_~#t1876~0.base, 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_~#t1878~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1877~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:23:48,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L805-1-->L807: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1877~0.base_11|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1877~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1877~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1877~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1877~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1877~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1877~0.base_11|) |v_ULTIMATE.start_main_~#t1877~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1877~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1877~0.base=|v_ULTIMATE.start_main_~#t1877~0.base_11|, ULTIMATE.start_main_~#t1877~0.offset=|v_ULTIMATE.start_main_~#t1877~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1877~0.base, ULTIMATE.start_main_~#t1877~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 22:23:48,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1878~0.base_9|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1878~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t1878~0.offset_8|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1878~0.base_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1878~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1878~0.base_9|) |v_ULTIMATE.start_main_~#t1878~0.offset_8| 2))) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1878~0.base_9| 4) |v_#length_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1878~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1878~0.offset=|v_ULTIMATE.start_main_~#t1878~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1878~0.base=|v_ULTIMATE.start_main_~#t1878~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1878~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1878~0.base] because there is no mapped edge [2019-12-18 22:23:48,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 2 v_~x$w_buff0~0_17) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= 1 v_~x$w_buff0_used~0_80) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~x$w_buff0~0_18 v_~x$w_buff1~0_15) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff1_used~0_49 v_~x$w_buff0_used~0_81) (= (mod v_~x$w_buff1_used~0_49 256) 0)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 22:23:48,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In947087399 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In947087399 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out947087399| ~x~0_In947087399) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out947087399| ~x$w_buff1~0_In947087399) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In947087399, ~x$w_buff1_used~0=~x$w_buff1_used~0_In947087399, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In947087399, ~x~0=~x~0_In947087399} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out947087399|, ~x$w_buff1~0=~x$w_buff1~0_In947087399, ~x$w_buff1_used~0=~x$w_buff1_used~0_In947087399, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In947087399, ~x~0=~x~0_In947087399} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 22:23:48,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 22:23:48,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-138054324 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-138054324 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out-138054324| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-138054324 |P2Thread1of1ForFork2_#t~ite17_Out-138054324|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-138054324, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-138054324} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-138054324, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-138054324|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-138054324} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:23:48,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1790104331 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1790104331 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1790104331 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1790104331 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1790104331 |P2Thread1of1ForFork2_#t~ite18_Out-1790104331|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out-1790104331| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1790104331, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1790104331, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1790104331, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1790104331} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1790104331, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1790104331, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1790104331, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1790104331|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1790104331} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 22:23:48,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out1007489851| |P0Thread1of1ForFork0_#t~ite4_Out1007489851|)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In1007489851 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1007489851 256)))) (or (and .cse0 (not .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out1007489851| ~x$w_buff1~0_In1007489851) (not .cse2)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out1007489851| ~x~0_In1007489851) .cse0 (or .cse2 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1007489851, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1007489851, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1007489851, ~x~0=~x~0_In1007489851} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1007489851|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1007489851|, ~x$w_buff1~0=~x$w_buff1~0_In1007489851, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1007489851, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1007489851, ~x~0=~x~0_In1007489851} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 22:23:48,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-393389950 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-393389950 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-393389950 |P0Thread1of1ForFork0_#t~ite5_Out-393389950|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-393389950|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-393389950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-393389950} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-393389950|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-393389950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-393389950} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:23:48,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1718187864 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1718187864 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In1718187864 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1718187864 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1718187864 |P0Thread1of1ForFork0_#t~ite6_Out1718187864|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1718187864|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1718187864, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1718187864, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1718187864, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1718187864} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1718187864|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1718187864, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1718187864, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1718187864, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1718187864} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:23:48,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1301184400 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1301184400 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out1301184400| ~x$r_buff0_thd3~0_In1301184400) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out1301184400| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1301184400, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1301184400} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1301184400, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1301184400|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1301184400} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 22:23:48,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd3~0_In2044490813 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In2044490813 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In2044490813 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In2044490813 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd3~0_In2044490813 |P2Thread1of1ForFork2_#t~ite20_Out2044490813|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out2044490813|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2044490813, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2044490813, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2044490813, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2044490813} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out2044490813|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2044490813, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2044490813, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2044490813, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2044490813} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 22:23:48,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_13)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, 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-18 22:23:48,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1246978130 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1246978130 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out-1246978130| ~x$r_buff0_thd1~0_In-1246978130) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-1246978130| 0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1246978130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1246978130} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1246978130, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1246978130|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1246978130} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 22:23:48,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-909426245 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-909426245 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-909426245 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-909426245 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-909426245|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd1~0_In-909426245 |P0Thread1of1ForFork0_#t~ite8_Out-909426245|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-909426245, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-909426245, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-909426245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-909426245} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-909426245, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-909426245|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-909426245, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-909426245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-909426245} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:23:48,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L737-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 22:23:48,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In204156413 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In204156413 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out204156413|) (not .cse1)) (and (= ~x$w_buff0_used~0_In204156413 |P1Thread1of1ForFork1_#t~ite11_Out204156413|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In204156413, ~x$w_buff0_used~0=~x$w_buff0_used~0_In204156413} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out204156413|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In204156413, ~x$w_buff0_used~0=~x$w_buff0_used~0_In204156413} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 22:23:48,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In887540973 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In887540973 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In887540973 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In887540973 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out887540973|)) (and (= ~x$w_buff1_used~0_In887540973 |P1Thread1of1ForFork1_#t~ite12_Out887540973|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In887540973, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In887540973, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In887540973, ~x$w_buff0_used~0=~x$w_buff0_used~0_In887540973} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In887540973, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In887540973, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out887540973|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In887540973, ~x$w_buff0_used~0=~x$w_buff0_used~0_In887540973} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 22:23:48,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1671960192 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1671960192 256)))) (or (and (= ~x$r_buff0_thd2~0_In1671960192 ~x$r_buff0_thd2~0_Out1671960192) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out1671960192) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1671960192, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1671960192} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1671960192|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1671960192, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1671960192} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:23:48,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-48146407 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-48146407 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-48146407 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-48146407 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-48146407 |P1Thread1of1ForFork1_#t~ite14_Out-48146407|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-48146407|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-48146407, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-48146407, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-48146407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-48146407} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-48146407, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-48146407, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-48146407, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-48146407|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-48146407} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 22:23:48,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:23:48,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:23:48,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite24_Out1105654016| |ULTIMATE.start_main_#t~ite25_Out1105654016|)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1105654016 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1105654016 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite24_Out1105654016| ~x$w_buff1~0_In1105654016)) (and .cse1 (= ~x~0_In1105654016 |ULTIMATE.start_main_#t~ite24_Out1105654016|) (or .cse0 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1105654016, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1105654016, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1105654016, ~x~0=~x~0_In1105654016} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1105654016, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1105654016|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1105654016|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1105654016, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1105654016, ~x~0=~x~0_In1105654016} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 22:23:48,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1008620424 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1008620424 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1008620424 |ULTIMATE.start_main_#t~ite26_Out1008620424|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out1008620424| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1008620424, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1008620424} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1008620424, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1008620424|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1008620424} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 22:23:48,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1678048599 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1678048599 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1678048599 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1678048599 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1678048599 |ULTIMATE.start_main_#t~ite27_Out-1678048599|)) (and (= 0 |ULTIMATE.start_main_#t~ite27_Out-1678048599|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1678048599, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1678048599, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1678048599, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1678048599} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1678048599, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1678048599, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1678048599|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1678048599, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1678048599} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 22:23:48,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1005998938 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1005998938 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In1005998938 |ULTIMATE.start_main_#t~ite28_Out1005998938|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out1005998938| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1005998938, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1005998938} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1005998938, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1005998938|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1005998938} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 22:23:48,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-351609118 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-351609118 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-351609118 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-351609118 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out-351609118|)) (and (= ~x$r_buff1_thd0~0_In-351609118 |ULTIMATE.start_main_#t~ite29_Out-351609118|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-351609118, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-351609118, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-351609118, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-351609118} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-351609118, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-351609118|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-351609118, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-351609118, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-351609118} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 22:23:48,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, 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_21} 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-18 22:23:48,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~x$flush_delayed~0_10 0) (= v_~x$mem_tmp~0_7 v_~x~0_25)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:23:48,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 22:23:49,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:23:49 BasicIcfg [2019-12-18 22:23:49,000 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:23:49,002 INFO L168 Benchmark]: Toolchain (without parser) took 91232.72 ms. Allocated memory was 145.2 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 100.0 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 22:23:49,003 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 22:23:49,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.64 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.6 MB in the beginning and 156.0 MB in the end (delta: -56.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:23:49,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.27 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 152.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 22:23:49,004 INFO L168 Benchmark]: Boogie Preprocessor took 40.61 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:23:49,008 INFO L168 Benchmark]: RCFGBuilder took 869.94 ms. Allocated memory is still 202.4 MB. Free memory was 150.1 MB in the beginning and 100.6 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-18 22:23:49,009 INFO L168 Benchmark]: TraceAbstraction took 89512.88 ms. Allocated memory was 202.4 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 99.9 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 22:23:49,013 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.47 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 725.64 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.6 MB in the beginning and 156.0 MB in the end (delta: -56.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.27 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 152.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.61 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 869.94 ms. Allocated memory is still 202.4 MB. Free memory was 150.1 MB in the beginning and 100.6 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89512.88 ms. Allocated memory was 202.4 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 99.9 MB in the beginning and 2.2 GB in the end (delta: -2.1 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: 3.8s, 174 ProgramPointsBefore, 96 ProgramPointsAfterwards, 211 TransitionsBefore, 109 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 28 ChoiceCompositions, 5983 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82010 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1876, ((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] [L807] FCALL, FORK 0 pthread_create(&t1877, ((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] [L809] FCALL, FORK 0 pthread_create(&t1878, ((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=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 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] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1] [L727] 1 y = 2 [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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] [L782] 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=1, __unbuffered_p2_EBX=1, 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] [L733] 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=1, __unbuffered_p2_EBX=1, 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] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 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) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 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 [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] 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=1, __unbuffered_p2_EBX=1, 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_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 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 [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 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) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 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 [L815] 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=1, __unbuffered_p2_EBX=1, 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] [L815] 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) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 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 [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 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 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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] [L826] 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=1, __unbuffered_p2_EBX=1, 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] [L826] 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) [L827] 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=1, __unbuffered_p2_EBX=1, 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] [L827] 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)) [L828] 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=1, __unbuffered_p2_EBX=1, 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] [L828] 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)) [L829] 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=1, __unbuffered_p2_EBX=1, 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] [L829] 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)) [L830] 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=1, __unbuffered_p2_EBX=1, 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] [L830] 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)) [L832] 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=1, __unbuffered_p2_EBX=1, 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] [L832] 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)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 89.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 25.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2868 SDtfs, 2615 SDslu, 5348 SDs, 0 SdLazy, 3037 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 29 SyntacticMatches, 11 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203645occurred 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: 37.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 81837 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 980 NumberOfCodeBlocks, 980 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 893 ConstructedInterpolants, 0 QuantifiedInterpolants, 172418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...