/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:09:06,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:09:06,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:09:06,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:09:06,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:09:06,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:09:06,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:09:06,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:09:06,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:09:06,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:09:06,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:09:06,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:09:06,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:09:06,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:09:06,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:09:06,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:09:06,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:09:06,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:09:06,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:09:06,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:09:06,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:09:06,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:09:06,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:09:06,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:09:06,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:09:06,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:09:06,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:09:06,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:09:06,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:09:06,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:09:06,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:09:06,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:09:06,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:09:06,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:09:06,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:09:06,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:09:06,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:09:06,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:09:06,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:09:06,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:09:06,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:09:06,537 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:09:06,560 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:09:06,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:09:06,564 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:09:06,564 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:09:06,565 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:09:06,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:09:06,565 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:09:06,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:09:06,566 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:09:06,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:09:06,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:09:06,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:09:06,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:09:06,568 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:09:06,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:09:06,568 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:09:06,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:09:06,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:09:06,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:09:06,569 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:09:06,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:09:06,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:09:06,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:09:06,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:09:06,570 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:09:06,571 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:09:06,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:09:06,571 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:09:06,571 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:09:06,571 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:09:06,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:09:06,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:09:06,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:09:06,877 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:09:06,878 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:09:06,879 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i [2019-12-26 22:09:06,941 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe22ca76/6521950f92b84ae59c6e901ab1f8868e/FLAG4caf23a35 [2019-12-26 22:09:07,522 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:09:07,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i [2019-12-26 22:09:07,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe22ca76/6521950f92b84ae59c6e901ab1f8868e/FLAG4caf23a35 [2019-12-26 22:09:07,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe22ca76/6521950f92b84ae59c6e901ab1f8868e [2019-12-26 22:09:07,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:09:07,782 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:09:07,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:09:07,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:09:07,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:09:07,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:09:07" (1/1) ... [2019-12-26 22:09:07,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:07, skipping insertion in model container [2019-12-26 22:09:07,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:09:07" (1/1) ... [2019-12-26 22:09:07,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:09:07,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:09:08,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:09:08,449 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:09:08,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:09:08,602 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:09:08,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:08 WrapperNode [2019-12-26 22:09:08,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:09:08,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:09:08,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:09:08,604 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:09:08,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:08" (1/1) ... [2019-12-26 22:09:08,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:08" (1/1) ... [2019-12-26 22:09:08,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:09:08,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:09:08,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:09:08,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:09:08,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:08" (1/1) ... [2019-12-26 22:09:08,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:08" (1/1) ... [2019-12-26 22:09:08,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:08" (1/1) ... [2019-12-26 22:09:08,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:08" (1/1) ... [2019-12-26 22:09:08,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:08" (1/1) ... [2019-12-26 22:09:08,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:08" (1/1) ... [2019-12-26 22:09:08,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:08" (1/1) ... [2019-12-26 22:09:08,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:09:08,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:09:08,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:09:08,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:09:08,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:08" (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-26 22:09:08,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:09:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:09:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:09:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:09:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:09:08,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:09:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:09:08,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:09:08,778 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:09:08,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:09:08,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:09:08,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:09:08,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:09:08,780 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:09:09,532 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:09:09,533 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:09:09,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:09:09 BoogieIcfgContainer [2019-12-26 22:09:09,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:09:09,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:09:09,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:09:09,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:09:09,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:09:07" (1/3) ... [2019-12-26 22:09:09,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cd3fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:09:09, skipping insertion in model container [2019-12-26 22:09:09,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:09:08" (2/3) ... [2019-12-26 22:09:09,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cd3fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:09:09, skipping insertion in model container [2019-12-26 22:09:09,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:09:09" (3/3) ... [2019-12-26 22:09:09,544 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_power.opt.i [2019-12-26 22:09:09,556 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:09:09,556 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:09:09,569 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:09:09,570 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:09:09,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,634 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,634 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,644 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,644 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,652 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,652 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,673 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,673 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,694 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,695 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,696 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,707 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,708 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:09:09,725 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:09:09,749 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:09:09,749 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:09:09,750 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:09:09,750 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:09:09,750 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:09:09,750 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:09:09,750 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:09:09,750 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:09:09,775 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-26 22:09:09,777 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 22:09:09,879 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 22:09:09,880 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:09:09,895 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:09:09,917 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 22:09:09,971 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 22:09:09,971 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:09:09,978 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:09:09,997 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-26 22:09:09,998 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:09:14,531 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-26 22:09:14,902 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-26 22:09:15,035 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 22:09:15,065 INFO L206 etLargeBlockEncoding]: Checked pairs total: 79058 [2019-12-26 22:09:15,065 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-26 22:09:15,069 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-26 22:09:32,770 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115078 states. [2019-12-26 22:09:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 115078 states. [2019-12-26 22:09:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 22:09:32,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:09:32,780 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 22:09:32,781 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-26 22:09:32,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:09:32,787 INFO L82 PathProgramCache]: Analyzing trace with hash 811621075, now seen corresponding path program 1 times [2019-12-26 22:09:32,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:09:32,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302637112] [2019-12-26 22:09:32,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:09:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:09:33,055 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-26 22:09:33,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302637112] [2019-12-26 22:09:33,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:09:33,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:09:33,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939705710] [2019-12-26 22:09:33,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:09:33,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:09:33,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:09:33,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:09:33,081 INFO L87 Difference]: Start difference. First operand 115078 states. Second operand 3 states. [2019-12-26 22:09:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:09:36,107 INFO L93 Difference]: Finished difference Result 114778 states and 493920 transitions. [2019-12-26 22:09:36,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:09:36,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 22:09:36,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:09:36,946 INFO L225 Difference]: With dead ends: 114778 [2019-12-26 22:09:36,946 INFO L226 Difference]: Without dead ends: 112412 [2019-12-26 22:09:36,948 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-26 22:09:43,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112412 states. [2019-12-26 22:09:45,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112412 to 112412. [2019-12-26 22:09:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112412 states. [2019-12-26 22:09:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112412 states to 112412 states and 484274 transitions. [2019-12-26 22:09:49,631 INFO L78 Accepts]: Start accepts. Automaton has 112412 states and 484274 transitions. Word has length 5 [2019-12-26 22:09:49,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:09:49,632 INFO L462 AbstractCegarLoop]: Abstraction has 112412 states and 484274 transitions. [2019-12-26 22:09:49,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:09:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 112412 states and 484274 transitions. [2019-12-26 22:09:49,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:09:49,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:09:49,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:09:49,635 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-26 22:09:49,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:09:49,636 INFO L82 PathProgramCache]: Analyzing trace with hash -287251583, now seen corresponding path program 1 times [2019-12-26 22:09:49,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:09:49,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182205853] [2019-12-26 22:09:49,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:09:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:09:49,762 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-26 22:09:49,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182205853] [2019-12-26 22:09:49,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:09:49,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:09:49,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676915049] [2019-12-26 22:09:49,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:09:49,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:09:49,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:09:49,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:09:49,766 INFO L87 Difference]: Start difference. First operand 112412 states and 484274 transitions. Second operand 4 states. [2019-12-26 22:09:55,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:09:55,347 INFO L93 Difference]: Finished difference Result 180702 states and 747767 transitions. [2019-12-26 22:09:55,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:09:55,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:09:55,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:09:55,959 INFO L225 Difference]: With dead ends: 180702 [2019-12-26 22:09:55,959 INFO L226 Difference]: Without dead ends: 180653 [2019-12-26 22:09:55,960 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-26 22:10:01,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180653 states. [2019-12-26 22:10:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180653 to 165577. [2019-12-26 22:10:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165577 states. [2019-12-26 22:10:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165577 states to 165577 states and 693075 transitions. [2019-12-26 22:10:05,848 INFO L78 Accepts]: Start accepts. Automaton has 165577 states and 693075 transitions. Word has length 11 [2019-12-26 22:10:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:05,849 INFO L462 AbstractCegarLoop]: Abstraction has 165577 states and 693075 transitions. [2019-12-26 22:10:05,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:10:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 165577 states and 693075 transitions. [2019-12-26 22:10:05,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:10:05,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:05,867 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:10:05,867 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-26 22:10:05,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash 228163746, now seen corresponding path program 1 times [2019-12-26 22:10:05,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:05,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216194420] [2019-12-26 22:10:05,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:05,983 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-26 22:10:05,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216194420] [2019-12-26 22:10:05,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:05,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:10:05,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389788187] [2019-12-26 22:10:05,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:10:05,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:05,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:10:05,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:10:05,986 INFO L87 Difference]: Start difference. First operand 165577 states and 693075 transitions. Second operand 4 states. [2019-12-26 22:10:13,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:13,320 INFO L93 Difference]: Finished difference Result 235681 states and 964563 transitions. [2019-12-26 22:10:13,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:10:13,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 22:10:13,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:13,991 INFO L225 Difference]: With dead ends: 235681 [2019-12-26 22:10:13,991 INFO L226 Difference]: Without dead ends: 235618 [2019-12-26 22:10:13,991 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-26 22:10:20,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235618 states. [2019-12-26 22:10:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235618 to 199613. [2019-12-26 22:10:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199613 states. [2019-12-26 22:10:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199613 states to 199613 states and 830031 transitions. [2019-12-26 22:10:33,343 INFO L78 Accepts]: Start accepts. Automaton has 199613 states and 830031 transitions. Word has length 13 [2019-12-26 22:10:33,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:33,344 INFO L462 AbstractCegarLoop]: Abstraction has 199613 states and 830031 transitions. [2019-12-26 22:10:33,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:10:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 199613 states and 830031 transitions. [2019-12-26 22:10:33,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:10:33,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:33,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:10:33,349 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-26 22:10:33,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:33,349 INFO L82 PathProgramCache]: Analyzing trace with hash 986322522, now seen corresponding path program 1 times [2019-12-26 22:10:33,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:33,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25073592] [2019-12-26 22:10:33,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:33,402 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-26 22:10:33,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25073592] [2019-12-26 22:10:33,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:33,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:10:33,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898626281] [2019-12-26 22:10:33,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:10:33,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:33,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:10:33,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:10:33,405 INFO L87 Difference]: Start difference. First operand 199613 states and 830031 transitions. Second operand 3 states. [2019-12-26 22:10:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:33,546 INFO L93 Difference]: Finished difference Result 39466 states and 128760 transitions. [2019-12-26 22:10:33,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:10:33,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:10:33,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:33,609 INFO L225 Difference]: With dead ends: 39466 [2019-12-26 22:10:33,609 INFO L226 Difference]: Without dead ends: 39466 [2019-12-26 22:10:33,609 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-26 22:10:33,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39466 states. [2019-12-26 22:10:34,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39466 to 39466. [2019-12-26 22:10:34,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39466 states. [2019-12-26 22:10:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39466 states to 39466 states and 128760 transitions. [2019-12-26 22:10:34,287 INFO L78 Accepts]: Start accepts. Automaton has 39466 states and 128760 transitions. Word has length 13 [2019-12-26 22:10:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:34,288 INFO L462 AbstractCegarLoop]: Abstraction has 39466 states and 128760 transitions. [2019-12-26 22:10:34,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:10:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 39466 states and 128760 transitions. [2019-12-26 22:10:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 22:10:34,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:34,292 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-26 22:10:34,292 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-26 22:10:34,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:34,292 INFO L82 PathProgramCache]: Analyzing trace with hash -462367392, now seen corresponding path program 1 times [2019-12-26 22:10:34,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:34,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861010785] [2019-12-26 22:10:34,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:34,393 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-26 22:10:34,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861010785] [2019-12-26 22:10:34,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:34,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:10:34,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221726279] [2019-12-26 22:10:34,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:10:34,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:34,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:10:34,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:10:34,396 INFO L87 Difference]: Start difference. First operand 39466 states and 128760 transitions. Second operand 5 states. [2019-12-26 22:10:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:36,882 INFO L93 Difference]: Finished difference Result 53323 states and 170492 transitions. [2019-12-26 22:10:36,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:10:36,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 22:10:36,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:36,966 INFO L225 Difference]: With dead ends: 53323 [2019-12-26 22:10:36,966 INFO L226 Difference]: Without dead ends: 53310 [2019-12-26 22:10:36,966 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-26 22:10:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53310 states. [2019-12-26 22:10:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53310 to 39837. [2019-12-26 22:10:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39837 states. [2019-12-26 22:10:37,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39837 states to 39837 states and 129810 transitions. [2019-12-26 22:10:37,769 INFO L78 Accepts]: Start accepts. Automaton has 39837 states and 129810 transitions. Word has length 19 [2019-12-26 22:10:37,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:37,769 INFO L462 AbstractCegarLoop]: Abstraction has 39837 states and 129810 transitions. [2019-12-26 22:10:37,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:10:37,770 INFO L276 IsEmpty]: Start isEmpty. Operand 39837 states and 129810 transitions. [2019-12-26 22:10:37,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:10:37,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:37,783 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-26 22:10:37,784 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-26 22:10:37,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:37,784 INFO L82 PathProgramCache]: Analyzing trace with hash 781437825, now seen corresponding path program 1 times [2019-12-26 22:10:37,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:37,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164125344] [2019-12-26 22:10:37,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:37,842 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-26 22:10:37,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164125344] [2019-12-26 22:10:37,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:37,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:10:37,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855436144] [2019-12-26 22:10:37,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:10:37,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:37,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:10:37,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:10:37,845 INFO L87 Difference]: Start difference. First operand 39837 states and 129810 transitions. Second operand 4 states. [2019-12-26 22:10:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:37,887 INFO L93 Difference]: Finished difference Result 7581 states and 20788 transitions. [2019-12-26 22:10:37,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:10:37,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:10:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:37,899 INFO L225 Difference]: With dead ends: 7581 [2019-12-26 22:10:37,900 INFO L226 Difference]: Without dead ends: 7581 [2019-12-26 22:10:37,900 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-26 22:10:37,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2019-12-26 22:10:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 7441. [2019-12-26 22:10:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7441 states. [2019-12-26 22:10:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 20388 transitions. [2019-12-26 22:10:38,000 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 20388 transitions. Word has length 25 [2019-12-26 22:10:38,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:38,000 INFO L462 AbstractCegarLoop]: Abstraction has 7441 states and 20388 transitions. [2019-12-26 22:10:38,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:10:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 20388 transitions. [2019-12-26 22:10:38,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 22:10:38,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:38,011 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-26 22:10:38,011 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-26 22:10:38,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:38,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1015424040, now seen corresponding path program 1 times [2019-12-26 22:10:38,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:38,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035879797] [2019-12-26 22:10:38,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:38,085 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-26 22:10:38,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035879797] [2019-12-26 22:10:38,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:38,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:10:38,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739418674] [2019-12-26 22:10:38,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:10:38,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:38,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:10:38,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:10:38,087 INFO L87 Difference]: Start difference. First operand 7441 states and 20388 transitions. Second operand 5 states. [2019-12-26 22:10:38,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:38,133 INFO L93 Difference]: Finished difference Result 5402 states and 15528 transitions. [2019-12-26 22:10:38,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:10:38,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 22:10:38,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:38,142 INFO L225 Difference]: With dead ends: 5402 [2019-12-26 22:10:38,142 INFO L226 Difference]: Without dead ends: 5402 [2019-12-26 22:10:38,142 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-26 22:10:38,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2019-12-26 22:10:38,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 4989. [2019-12-26 22:10:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-12-26 22:10:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 14411 transitions. [2019-12-26 22:10:38,228 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 14411 transitions. Word has length 37 [2019-12-26 22:10:38,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:38,228 INFO L462 AbstractCegarLoop]: Abstraction has 4989 states and 14411 transitions. [2019-12-26 22:10:38,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:10:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 14411 transitions. [2019-12-26 22:10:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:10:38,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:38,237 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-26 22:10:38,237 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-26 22:10:38,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:38,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1550906862, now seen corresponding path program 1 times [2019-12-26 22:10:38,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:38,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950908195] [2019-12-26 22:10:38,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:38,303 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-26 22:10:38,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950908195] [2019-12-26 22:10:38,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:38,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:10:38,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114514023] [2019-12-26 22:10:38,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:10:38,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:38,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:10:38,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:10:38,306 INFO L87 Difference]: Start difference. First operand 4989 states and 14411 transitions. Second operand 3 states. [2019-12-26 22:10:38,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:38,364 INFO L93 Difference]: Finished difference Result 4998 states and 14420 transitions. [2019-12-26 22:10:38,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:10:38,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:10:38,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:38,371 INFO L225 Difference]: With dead ends: 4998 [2019-12-26 22:10:38,371 INFO L226 Difference]: Without dead ends: 4998 [2019-12-26 22:10:38,372 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-26 22:10:38,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4998 states. [2019-12-26 22:10:39,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4998 to 4994. [2019-12-26 22:10:39,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4994 states. [2019-12-26 22:10:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 14416 transitions. [2019-12-26 22:10:39,162 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 14416 transitions. Word has length 65 [2019-12-26 22:10:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:39,163 INFO L462 AbstractCegarLoop]: Abstraction has 4994 states and 14416 transitions. [2019-12-26 22:10:39,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:10:39,163 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 14416 transitions. [2019-12-26 22:10:39,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:10:39,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:39,169 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-26 22:10:39,170 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-26 22:10:39,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:39,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1256158932, now seen corresponding path program 1 times [2019-12-26 22:10:39,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:39,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104832501] [2019-12-26 22:10:39,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:10:39,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104832501] [2019-12-26 22:10:39,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:39,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:10:39,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449385243] [2019-12-26 22:10:39,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:10:39,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:39,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:10:39,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:10:39,309 INFO L87 Difference]: Start difference. First operand 4994 states and 14416 transitions. Second operand 5 states. [2019-12-26 22:10:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:39,677 INFO L93 Difference]: Finished difference Result 7928 states and 22567 transitions. [2019-12-26 22:10:39,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:10:39,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 22:10:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:39,688 INFO L225 Difference]: With dead ends: 7928 [2019-12-26 22:10:39,688 INFO L226 Difference]: Without dead ends: 7928 [2019-12-26 22:10:39,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:10:39,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7928 states. [2019-12-26 22:10:39,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7928 to 5806. [2019-12-26 22:10:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5806 states. [2019-12-26 22:10:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5806 states to 5806 states and 16813 transitions. [2019-12-26 22:10:39,778 INFO L78 Accepts]: Start accepts. Automaton has 5806 states and 16813 transitions. Word has length 65 [2019-12-26 22:10:39,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:39,778 INFO L462 AbstractCegarLoop]: Abstraction has 5806 states and 16813 transitions. [2019-12-26 22:10:39,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:10:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 5806 states and 16813 transitions. [2019-12-26 22:10:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:10:39,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:39,786 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-26 22:10:39,786 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-26 22:10:39,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:39,787 INFO L82 PathProgramCache]: Analyzing trace with hash 343857822, now seen corresponding path program 2 times [2019-12-26 22:10:39,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:39,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436949527] [2019-12-26 22:10:39,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:39,893 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-26 22:10:39,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436949527] [2019-12-26 22:10:39,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:39,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:10:39,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668582500] [2019-12-26 22:10:39,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:10:39,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:39,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:10:39,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:10:39,895 INFO L87 Difference]: Start difference. First operand 5806 states and 16813 transitions. Second operand 6 states. [2019-12-26 22:10:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:40,436 INFO L93 Difference]: Finished difference Result 9867 states and 28335 transitions. [2019-12-26 22:10:40,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:10:40,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 22:10:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:40,450 INFO L225 Difference]: With dead ends: 9867 [2019-12-26 22:10:40,450 INFO L226 Difference]: Without dead ends: 9867 [2019-12-26 22:10:40,451 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-26 22:10:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9867 states. [2019-12-26 22:10:40,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9867 to 6339. [2019-12-26 22:10:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6339 states. [2019-12-26 22:10:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 18398 transitions. [2019-12-26 22:10:40,562 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 18398 transitions. Word has length 65 [2019-12-26 22:10:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:40,562 INFO L462 AbstractCegarLoop]: Abstraction has 6339 states and 18398 transitions. [2019-12-26 22:10:40,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:10:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 18398 transitions. [2019-12-26 22:10:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:10:40,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:40,571 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-26 22:10:40,571 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-26 22:10:40,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:40,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1151551294, now seen corresponding path program 3 times [2019-12-26 22:10:40,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:40,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82795917] [2019-12-26 22:10:40,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:40,694 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-26 22:10:40,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82795917] [2019-12-26 22:10:40,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:40,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:10:40,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421823150] [2019-12-26 22:10:40,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:10:40,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:40,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:10:40,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:10:40,696 INFO L87 Difference]: Start difference. First operand 6339 states and 18398 transitions. Second operand 6 states. [2019-12-26 22:10:41,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:41,217 INFO L93 Difference]: Finished difference Result 8650 states and 24438 transitions. [2019-12-26 22:10:41,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:10:41,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 22:10:41,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:41,228 INFO L225 Difference]: With dead ends: 8650 [2019-12-26 22:10:41,229 INFO L226 Difference]: Without dead ends: 8650 [2019-12-26 22:10:41,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:10:41,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8650 states. [2019-12-26 22:10:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8650 to 6900. [2019-12-26 22:10:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6900 states. [2019-12-26 22:10:41,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6900 states to 6900 states and 19712 transitions. [2019-12-26 22:10:41,337 INFO L78 Accepts]: Start accepts. Automaton has 6900 states and 19712 transitions. Word has length 65 [2019-12-26 22:10:41,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:41,337 INFO L462 AbstractCegarLoop]: Abstraction has 6900 states and 19712 transitions. [2019-12-26 22:10:41,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:10:41,337 INFO L276 IsEmpty]: Start isEmpty. Operand 6900 states and 19712 transitions. [2019-12-26 22:10:41,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:10:41,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:41,346 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-26 22:10:41,346 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-26 22:10:41,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:41,347 INFO L82 PathProgramCache]: Analyzing trace with hash 663923916, now seen corresponding path program 4 times [2019-12-26 22:10:41,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:41,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881838348] [2019-12-26 22:10:41,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:41,427 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-26 22:10:41,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881838348] [2019-12-26 22:10:41,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:41,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:10:41,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103915867] [2019-12-26 22:10:41,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:10:41,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:41,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:10:41,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:10:41,429 INFO L87 Difference]: Start difference. First operand 6900 states and 19712 transitions. Second operand 3 states. [2019-12-26 22:10:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:41,460 INFO L93 Difference]: Finished difference Result 6337 states and 17866 transitions. [2019-12-26 22:10:41,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:10:41,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:10:41,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:41,469 INFO L225 Difference]: With dead ends: 6337 [2019-12-26 22:10:41,469 INFO L226 Difference]: Without dead ends: 6337 [2019-12-26 22:10:41,470 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-26 22:10:41,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2019-12-26 22:10:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 6169. [2019-12-26 22:10:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6169 states. [2019-12-26 22:10:41,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6169 states to 6169 states and 17400 transitions. [2019-12-26 22:10:41,556 INFO L78 Accepts]: Start accepts. Automaton has 6169 states and 17400 transitions. Word has length 65 [2019-12-26 22:10:41,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:41,557 INFO L462 AbstractCegarLoop]: Abstraction has 6169 states and 17400 transitions. [2019-12-26 22:10:41,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:10:41,557 INFO L276 IsEmpty]: Start isEmpty. Operand 6169 states and 17400 transitions. [2019-12-26 22:10:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:10:41,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:41,565 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-26 22:10:41,565 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-26 22:10:41,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:41,566 INFO L82 PathProgramCache]: Analyzing trace with hash 956425645, now seen corresponding path program 1 times [2019-12-26 22:10:41,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:41,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084389899] [2019-12-26 22:10:41,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:41,676 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-26 22:10:41,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084389899] [2019-12-26 22:10:41,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:41,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:10:41,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699763763] [2019-12-26 22:10:41,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:10:41,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:41,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:10:41,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:10:41,678 INFO L87 Difference]: Start difference. First operand 6169 states and 17400 transitions. Second operand 7 states. [2019-12-26 22:10:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:42,164 INFO L93 Difference]: Finished difference Result 8320 states and 23209 transitions. [2019-12-26 22:10:42,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:10:42,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-26 22:10:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:42,177 INFO L225 Difference]: With dead ends: 8320 [2019-12-26 22:10:42,178 INFO L226 Difference]: Without dead ends: 8320 [2019-12-26 22:10:42,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:10:42,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8320 states. [2019-12-26 22:10:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8320 to 6561. [2019-12-26 22:10:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6561 states. [2019-12-26 22:10:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 18492 transitions. [2019-12-26 22:10:42,311 INFO L78 Accepts]: Start accepts. Automaton has 6561 states and 18492 transitions. Word has length 66 [2019-12-26 22:10:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:42,311 INFO L462 AbstractCegarLoop]: Abstraction has 6561 states and 18492 transitions. [2019-12-26 22:10:42,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:10:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 6561 states and 18492 transitions. [2019-12-26 22:10:42,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:10:42,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:42,320 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-26 22:10:42,320 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-26 22:10:42,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:42,320 INFO L82 PathProgramCache]: Analyzing trace with hash 426723893, now seen corresponding path program 2 times [2019-12-26 22:10:42,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:42,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733148516] [2019-12-26 22:10:42,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:42,379 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-26 22:10:42,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733148516] [2019-12-26 22:10:42,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:42,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:10:42,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843746681] [2019-12-26 22:10:42,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:10:42,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:42,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:10:42,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:10:42,381 INFO L87 Difference]: Start difference. First operand 6561 states and 18492 transitions. Second operand 3 states. [2019-12-26 22:10:42,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:42,437 INFO L93 Difference]: Finished difference Result 6561 states and 18491 transitions. [2019-12-26 22:10:42,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:10:42,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 22:10:42,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:42,447 INFO L225 Difference]: With dead ends: 6561 [2019-12-26 22:10:42,447 INFO L226 Difference]: Without dead ends: 6561 [2019-12-26 22:10:42,448 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-26 22:10:42,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6561 states. [2019-12-26 22:10:43,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6561 to 4174. [2019-12-26 22:10:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-12-26 22:10:43,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 11909 transitions. [2019-12-26 22:10:43,922 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 11909 transitions. Word has length 66 [2019-12-26 22:10:43,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:43,922 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 11909 transitions. [2019-12-26 22:10:43,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:10:43,922 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 11909 transitions. [2019-12-26 22:10:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:10:43,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:43,928 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-26 22:10:43,929 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-26 22:10:43,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:43,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1488093963, now seen corresponding path program 1 times [2019-12-26 22:10:43,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:43,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935004291] [2019-12-26 22:10:43,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:44,012 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-26 22:10:44,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935004291] [2019-12-26 22:10:44,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:44,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:10:44,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526361901] [2019-12-26 22:10:44,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:10:44,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:44,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:10:44,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:10:44,014 INFO L87 Difference]: Start difference. First operand 4174 states and 11909 transitions. Second operand 3 states. [2019-12-26 22:10:44,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:44,036 INFO L93 Difference]: Finished difference Result 3865 states and 10844 transitions. [2019-12-26 22:10:44,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:10:44,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-26 22:10:44,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:44,042 INFO L225 Difference]: With dead ends: 3865 [2019-12-26 22:10:44,042 INFO L226 Difference]: Without dead ends: 3865 [2019-12-26 22:10:44,044 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-26 22:10:44,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3865 states. [2019-12-26 22:10:44,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3865 to 3409. [2019-12-26 22:10:44,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2019-12-26 22:10:44,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 9568 transitions. [2019-12-26 22:10:44,114 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 9568 transitions. Word has length 67 [2019-12-26 22:10:44,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:44,114 INFO L462 AbstractCegarLoop]: Abstraction has 3409 states and 9568 transitions. [2019-12-26 22:10:44,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:10:44,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 9568 transitions. [2019-12-26 22:10:44,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 22:10:44,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:44,123 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-26 22:10:44,124 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-26 22:10:44,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:44,124 INFO L82 PathProgramCache]: Analyzing trace with hash -2084050195, now seen corresponding path program 1 times [2019-12-26 22:10:44,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:44,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4670607] [2019-12-26 22:10:44,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:44,371 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-26 22:10:44,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4670607] [2019-12-26 22:10:44,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:44,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:10:44,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247966713] [2019-12-26 22:10:44,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:10:44,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:44,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:10:44,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:10:44,373 INFO L87 Difference]: Start difference. First operand 3409 states and 9568 transitions. Second operand 12 states. [2019-12-26 22:10:45,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:45,206 INFO L93 Difference]: Finished difference Result 10267 states and 29089 transitions. [2019-12-26 22:10:45,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 22:10:45,206 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-26 22:10:45,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:45,213 INFO L225 Difference]: With dead ends: 10267 [2019-12-26 22:10:45,213 INFO L226 Difference]: Without dead ends: 4535 [2019-12-26 22:10:45,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2019-12-26 22:10:45,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2019-12-26 22:10:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 2821. [2019-12-26 22:10:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2821 states. [2019-12-26 22:10:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 7861 transitions. [2019-12-26 22:10:45,266 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 7861 transitions. Word has length 68 [2019-12-26 22:10:45,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:45,266 INFO L462 AbstractCegarLoop]: Abstraction has 2821 states and 7861 transitions. [2019-12-26 22:10:45,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:10:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 7861 transitions. [2019-12-26 22:10:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 22:10:45,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:45,270 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-26 22:10:45,271 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-26 22:10:45,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:45,271 INFO L82 PathProgramCache]: Analyzing trace with hash -293308025, now seen corresponding path program 2 times [2019-12-26 22:10:45,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:45,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976870749] [2019-12-26 22:10:45,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:45,378 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-26 22:10:45,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976870749] [2019-12-26 22:10:45,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:45,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:10:45,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590036008] [2019-12-26 22:10:45,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:10:45,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:45,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:10:45,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:10:45,381 INFO L87 Difference]: Start difference. First operand 2821 states and 7861 transitions. Second operand 5 states. [2019-12-26 22:10:45,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:45,456 INFO L93 Difference]: Finished difference Result 4677 states and 13024 transitions. [2019-12-26 22:10:45,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:10:45,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-26 22:10:45,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:45,459 INFO L225 Difference]: With dead ends: 4677 [2019-12-26 22:10:45,460 INFO L226 Difference]: Without dead ends: 1897 [2019-12-26 22:10:45,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:10:45,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2019-12-26 22:10:45,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1897. [2019-12-26 22:10:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1897 states. [2019-12-26 22:10:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 5235 transitions. [2019-12-26 22:10:45,521 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 5235 transitions. Word has length 68 [2019-12-26 22:10:45,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:10:45,521 INFO L462 AbstractCegarLoop]: Abstraction has 1897 states and 5235 transitions. [2019-12-26 22:10:45,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:10:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 5235 transitions. [2019-12-26 22:10:45,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 22:10:45,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:45,526 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-26 22:10:45,526 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-26 22:10:45,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:45,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1266757317, now seen corresponding path program 3 times [2019-12-26 22:10:45,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:45,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833304181] [2019-12-26 22:10:45,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:10:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:10:45,708 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:10:45,709 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:10:45,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_23) (= v_~z~0_18 0) (= 0 v_~weak$$choice0~0_14) (= v_~x$flush_delayed~0_41 0) (= 0 v_~x$r_buff0_thd3~0_99) (= v_~x$r_buff1_thd1~0_192 0) (= 0 v_~x$w_buff0~0_203) (= v_~weak$$choice2~0_116 0) (< 0 |v_#StackHeapBarrier_17|) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t748~0.base_20| 1)) (= 0 v_~x$r_buff1_thd3~0_193) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff1~0_195) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t748~0.base_20| 4)) (= v_~x$mem_tmp~0_22 0) (= v_~__unbuffered_p2_EBX~0_23 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t748~0.base_20| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t748~0.base_20|) |v_ULTIMATE.start_main_~#t748~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~x$r_buff0_thd2~0_205) (= v_~main$tmp_guard1~0_28 0) (= v_~x$r_buff0_thd0~0_335 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_279 0) (= 0 v_~x$w_buff1_used~0_401) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t748~0.base_20|) (= v_~__unbuffered_cnt~0_145 0) (= |v_ULTIMATE.start_main_~#t748~0.offset_17| 0) (= 0 v_~x$r_buff1_thd2~0_186) (= 0 v_~x$w_buff0_used~0_743) (= |v_#NULL.offset_5| 0) (= 0 v_~x~0_213) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~x$r_buff0_thd1~0_88) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t748~0.base_20|)) (= 0 |v_#NULL.base_5|) (= v_~y~0_136 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_203, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_41, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_31|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_192, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_99, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, ULTIMATE.start_main_~#t749~0.offset=|v_ULTIMATE.start_main_~#t749~0.offset_17|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ULTIMATE.start_main_~#t748~0.base=|v_ULTIMATE.start_main_~#t748~0.base_20|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_335, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_23, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ~x$w_buff1~0=v_~x$w_buff1~0_195, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_46|, ULTIMATE.start_main_~#t750~0.offset=|v_ULTIMATE.start_main_~#t750~0.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_401, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_186, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_50|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_156|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_213, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_193, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_~#t748~0.offset=|v_ULTIMATE.start_main_~#t748~0.offset_17|, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_33|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_273|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_34|, ~y~0=v_~y~0_136, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_279, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_205, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_743, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_162|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t749~0.base=|v_ULTIMATE.start_main_~#t749~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_18, ULTIMATE.start_main_~#t750~0.base=|v_ULTIMATE.start_main_~#t750~0.base_21|, ~weak$$choice2~0=v_~weak$$choice2~0_116, ~x$read_delayed~0=v_~x$read_delayed~0_7} 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_~#t749~0.offset, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t748~0.base, ~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, ULTIMATE.start_main_~#t750~0.offset, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t748~0.offset, 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_#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, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t749~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t750~0.base, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 22:10:45,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L810-1-->L812: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t749~0.base_13|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t749~0.base_13| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t749~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t749~0.base_13| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t749~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t749~0.base_13|) |v_ULTIMATE.start_main_~#t749~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t749~0.base_13|) (= |v_ULTIMATE.start_main_~#t749~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t749~0.offset=|v_ULTIMATE.start_main_~#t749~0.offset_11|, ULTIMATE.start_main_~#t749~0.base=|v_ULTIMATE.start_main_~#t749~0.base_13|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t749~0.offset, ULTIMATE.start_main_~#t749~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 22:10:45,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L812-1-->L814: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t750~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t750~0.base_13|) |v_ULTIMATE.start_main_~#t750~0.offset_11| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t750~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t750~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t750~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t750~0.base_13| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t750~0.offset_11|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t750~0.base_13| 1) |v_#valid_34|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t750~0.offset=|v_ULTIMATE.start_main_~#t750~0.offset_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t750~0.base=|v_ULTIMATE.start_main_~#t750~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t750~0.offset, #length, ULTIMATE.start_main_~#t750~0.base] because there is no mapped edge [2019-12-26 22:10:45,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_12 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|) (= (mod v_~x$w_buff1_used~0_145 256) 0) (= v_~x$w_buff0~0_44 v_~x$w_buff1~0_51) (= 2 v_~x$w_buff0~0_43) (= 1 v_~x$w_buff0_used~0_300) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|) (= v_~x$w_buff0_used~0_301 v_~x$w_buff1_used~0_145)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_12, ~x$w_buff0~0=v_~x$w_buff0~0_43, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_145, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_300} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 22:10:45,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L787-2-->L787-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In592841451 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In592841451 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In592841451 |P2Thread1of1ForFork2_#t~ite15_Out592841451|)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In592841451 |P2Thread1of1ForFork2_#t~ite15_Out592841451|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In592841451, ~x$w_buff1_used~0=~x$w_buff1_used~0_In592841451, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In592841451, ~x~0=~x~0_In592841451} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out592841451|, ~x$w_buff1~0=~x$w_buff1~0_In592841451, ~x$w_buff1_used~0=~x$w_buff1_used~0_In592841451, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In592841451, ~x~0=~x~0_In592841451} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 22:10:45,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L787-4-->L788: Formula: (= v_~x~0_30 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_9|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-26 22:10:45,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L735-2-->L735-5: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd1~0_In-239527355 256) 0)) (.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out-239527355| |P0Thread1of1ForFork0_#t~ite4_Out-239527355|)) (.cse2 (= (mod ~x$w_buff1_used~0_In-239527355 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-239527355| ~x~0_In-239527355) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out-239527355| ~x$w_buff1~0_In-239527355) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-239527355, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-239527355, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-239527355, ~x~0=~x~0_In-239527355} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-239527355|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-239527355|, ~x$w_buff1~0=~x$w_buff1~0_In-239527355, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-239527355, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-239527355, ~x~0=~x~0_In-239527355} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 22:10:45,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L736-->L736-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-798973507 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-798973507 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-798973507 |P0Thread1of1ForFork0_#t~ite5_Out-798973507|)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-798973507| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-798973507, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-798973507} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-798973507|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-798973507, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-798973507} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 22:10:45,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In2024829242 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In2024829242 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out2024829242| 0)) (and (= ~x$w_buff0_used~0_In2024829242 |P2Thread1of1ForFork2_#t~ite17_Out2024829242|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2024829242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2024829242} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2024829242, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out2024829242|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2024829242} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 22:10:45,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-1892580444 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1892580444 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-1892580444 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1892580444 256) 0))) (or (and (= ~x$w_buff1_used~0_In-1892580444 |P2Thread1of1ForFork2_#t~ite18_Out-1892580444|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out-1892580444| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1892580444, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1892580444, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1892580444, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1892580444} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1892580444, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1892580444, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1892580444, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1892580444|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1892580444} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-26 22:10:45,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L737-->L737-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In1545466055 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In1545466055 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1545466055 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1545466055 256) 0))) (or (and (= ~x$w_buff1_used~0_In1545466055 |P0Thread1of1ForFork0_#t~ite6_Out1545466055|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1545466055| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1545466055, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1545466055, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1545466055, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1545466055} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1545466055|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1545466055, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1545466055, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1545466055, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1545466055} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 22:10:45,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L790-->L790-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In983495777 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In983495777 256) 0))) (or (and (= ~x$r_buff0_thd3~0_In983495777 |P2Thread1of1ForFork2_#t~ite19_Out983495777|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out983495777|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In983495777, ~x$w_buff0_used~0=~x$w_buff0_used~0_In983495777} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In983495777, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out983495777|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In983495777} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-26 22:10:45,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1740545651 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1740545651 256))) (.cse2 (= (mod ~x$r_buff1_thd3~0_In1740545651 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1740545651 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd3~0_In1740545651 |P2Thread1of1ForFork2_#t~ite20_Out1740545651|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out1740545651|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1740545651, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1740545651, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1740545651, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1740545651} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1740545651|, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1740545651, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1740545651, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1740545651, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1740545651} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-26 22:10:45,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L791-2-->P2EXIT: Formula: (and (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork2_#t~ite20_28|) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_27|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 22:10:45,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-158999436 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-158999436 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-158999436| ~x$w_buff0_used~0_In-158999436)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-158999436| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-158999436, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-158999436} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-158999436|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-158999436, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-158999436} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 22:10:45,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In1267413709 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1267413709 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1267413709 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1267413709 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out1267413709| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out1267413709| ~x$w_buff1_used~0_In1267413709)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1267413709, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1267413709, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1267413709, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1267413709} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1267413709, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1267413709, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1267413709|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1267413709, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1267413709} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 22:10:45,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L767-->L768: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In920201697 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In920201697 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In920201697 ~x$r_buff0_thd2~0_Out920201697)) (and (= 0 ~x$r_buff0_thd2~0_Out920201697) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In920201697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In920201697} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out920201697|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out920201697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In920201697} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 22:10:45,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In-1561292302 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1561292302 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1561292302 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1561292302 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1561292302| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1561292302 |P1Thread1of1ForFork1_#t~ite14_Out-1561292302|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1561292302, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1561292302, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1561292302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1561292302} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1561292302, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1561292302, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1561292302, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1561292302|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1561292302} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 22:10:45,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L768-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 22:10:45,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L738-->L738-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1557832340 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1557832340 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1557832340|) (not .cse1)) (and (= ~x$r_buff0_thd1~0_In1557832340 |P0Thread1of1ForFork0_#t~ite7_Out1557832340|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1557832340, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1557832340} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1557832340, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1557832340|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1557832340} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 22:10:45,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In176235096 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In176235096 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In176235096 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In176235096 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out176235096| ~x$r_buff1_thd1~0_In176235096)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out176235096| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In176235096, ~x$w_buff1_used~0=~x$w_buff1_used~0_In176235096, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In176235096, ~x$w_buff0_used~0=~x$w_buff0_used~0_In176235096} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In176235096, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out176235096|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In176235096, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In176235096, ~x$w_buff0_used~0=~x$w_buff0_used~0_In176235096} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 22:10:45,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_40 |v_P0Thread1of1ForFork0_#t~ite8_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_19|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-26 22:10:45,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L820: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:10:45,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L820-2-->L820-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite25_Out726719173| |ULTIMATE.start_main_#t~ite24_Out726719173|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In726719173 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In726719173 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite24_Out726719173| ~x$w_buff1~0_In726719173) .cse2) (and (= ~x~0_In726719173 |ULTIMATE.start_main_#t~ite24_Out726719173|) .cse2 (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In726719173, ~x$w_buff1_used~0=~x$w_buff1_used~0_In726719173, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In726719173, ~x~0=~x~0_In726719173} OutVars{~x$w_buff1~0=~x$w_buff1~0_In726719173, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out726719173|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out726719173|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In726719173, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In726719173, ~x~0=~x~0_In726719173} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-26 22:10:45,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In855267197 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In855267197 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In855267197 |ULTIMATE.start_main_#t~ite26_Out855267197|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite26_Out855267197|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In855267197, ~x$w_buff0_used~0=~x$w_buff0_used~0_In855267197} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In855267197, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out855267197|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In855267197} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-26 22:10:45,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1045895256 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1045895256 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1045895256 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1045895256 256)))) (or (and (= ~x$w_buff1_used~0_In-1045895256 |ULTIMATE.start_main_#t~ite27_Out-1045895256|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-1045895256|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1045895256, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1045895256, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1045895256, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1045895256} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1045895256, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1045895256, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1045895256|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1045895256, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1045895256} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-26 22:10:45,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-416286722 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-416286722 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-416286722 |ULTIMATE.start_main_#t~ite28_Out-416286722|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out-416286722| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-416286722, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-416286722} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-416286722, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-416286722|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-416286722} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-26 22:10:45,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-296261548 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-296261548 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-296261548 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-296261548 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-296261548 |ULTIMATE.start_main_#t~ite29_Out-296261548|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out-296261548|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-296261548, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-296261548, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-296261548, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-296261548} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-296261548, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-296261548|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-296261548, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-296261548, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-296261548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 22:10:45,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L836-->L837: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd0~0_87 v_~x$r_buff0_thd0~0_86)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_86, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 22:10:45,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L839-->L4: Formula: (and (= v_~x$flush_delayed~0_24 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_25 256) 0)) (= v_~x$mem_tmp~0_15 v_~x~0_173)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_173, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:10:45,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 22:10:45,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:10:45 BasicIcfg [2019-12-26 22:10:45,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:10:45,895 INFO L168 Benchmark]: Toolchain (without parser) took 98113.25 ms. Allocated memory was 143.7 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 98.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 673.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:10:45,895 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 22:10:45,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.00 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 98.4 MB in the beginning and 155.0 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:10:45,897 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.78 ms. Allocated memory is still 201.3 MB. Free memory was 155.0 MB in the beginning and 151.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-26 22:10:45,897 INFO L168 Benchmark]: Boogie Preprocessor took 37.88 ms. Allocated memory is still 201.3 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:10:45,898 INFO L168 Benchmark]: RCFGBuilder took 826.13 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 99.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:10:45,898 INFO L168 Benchmark]: TraceAbstraction took 96357.09 ms. Allocated memory was 201.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 98.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 615.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:10:45,902 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 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 820.00 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 98.4 MB in the beginning and 155.0 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.78 ms. Allocated memory is still 201.3 MB. Free memory was 155.0 MB in the beginning and 151.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.88 ms. Allocated memory is still 201.3 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 826.13 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 99.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 96357.09 ms. Allocated memory was 201.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 98.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 615.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 107 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 5405 VarBasedMoverChecksPositive, 232 VarBasedMoverChecksNegative, 72 SemBasedMoverChecksPositive, 228 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 79058 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t748, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t749, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t750, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L754] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L755] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L756] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L757] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L758] 2 x$r_buff0_thd2 = (_Bool)1 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L788] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L789] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L790] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L820] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L821] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L822] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L823] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L824] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 x$flush_delayed = weak$$choice2 [L830] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L832] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L833] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L834] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L834] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L835] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L837] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 95.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 24.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2649 SDtfs, 2121 SDslu, 4853 SDs, 0 SdLazy, 3085 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 32 SyntacticMatches, 10 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199613occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 46.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 78995 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 851 NumberOfCodeBlocks, 851 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 766 ConstructedInterpolants, 0 QuantifiedInterpolants, 120078 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...